國立虎尾科技大學 |

Algorithms and Data Structures = 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithms and Data Structures/ edited by Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R Salavatipour.
其他題名:	16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings /
其他作者:	Friggstad, Zachary.
面頁冊數:	XX, 594 p. 416 illus., 95 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-030-24766-9
ISBN:	9783030247669

Algorithms and Data Structures = 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings /
Algorithms and Data Structures16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings /[electronic resource] :edited by Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R Salavatipour. - 1st ed. 2019. - XX, 594 p. 416 illus., 95 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11646. - Theoretical Computer Science and General Issues ;9163.

Graphs in Nature -- Set Similarity - a Survey -- Concurrent Connected Components Algorithms: Recent Results and Open Problems -- Succinct Data Structures for Families of Interval Graphs -- On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow -- Efficient Nearest-Neighbor Query and Clustering of Planar Curves -- Positive-Instance Driven Dynamic Programming for Graph Searching -- How to Morph a Tree on a Small Grid -- Approximating the robust bin-packing with budget uncertainty -- Rank-Select Indices Without Tears -- A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs -- A Framework for Vehicle Routing Approximation Schemes in Trees -- Avoidable Vertices and Edges in Graphs -- Plane Hop Spanners for Unit Disk Graphs -- On the Minimum Consistent Subset Problem -- Parameterized Complexity of Conict-free Graph Coloring -- Graph Isomorphism for (H1,H2)-Free Graphs: An Almost Complete Dichotomy -- Hamiltonicity for convex shape Delaunay and Gabriel graphs -- Computing Maximum Independent Set on Outerstring Graphs and Their Relatives -- Online Bin Covering with Advice -- Stackelberg Packing Games -- Range closest-pair search in higher dimensions -- Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles -- Kernelization of Graph Hamiltonicity: Proper H-Graphs -- Weighted Throughput Maximization with Calibrations -- Maximizing Dominance in the Plane and its Applications -- Extending Upward Planar Graph Drawings -- Online Circle Packing -- Guess Free Maximization of Submodular and Linear Sums -- Efficient Second-Order Shape-Constrained Function Fitting -- Dynamic Online Dictionary Matching -- Balanced Stable Marriage: How Close is Close Enough? -- Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint -- Inventory Routing Problem with Facility Location -- A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space -- Geometric Firefighting in the Half-plane -- Most vital segment barriers -- Splaying Preorders and Postorders -- Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS -- Discrete Morse Theory for Computing Zigzag Persistence -- Optimal Offline Dynamic 2,3-Edge/Vertex Connectivity -- Zip Trees -- Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points.

This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.

ISBN: 9783030247669

Standard No.: 10.1007/978-3-030-24766-9doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algorithms and Data Structures = 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings /
LDR:04386nam a22004095i 4500 001 1014721
003 DE-He213
005 20200629200356.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030247669 $9 978-3-030-24766-9
024 7 $a 10.1007/978-3-030-24766-9 $2 doi
035 $a 978-3-030-24766-9
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Algorithms and Data Structures $h [electronic resource] : $b 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings / $c edited by Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R Salavatipour.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XX, 594 p. 416 illus., 95 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11646
505 0 $a Graphs in Nature -- Set Similarity - a Survey -- Concurrent Connected Components Algorithms: Recent Results and Open Problems -- Succinct Data Structures for Families of Interval Graphs -- On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow -- Efficient Nearest-Neighbor Query and Clustering of Planar Curves -- Positive-Instance Driven Dynamic Programming for Graph Searching -- How to Morph a Tree on a Small Grid -- Approximating the robust bin-packing with budget uncertainty -- Rank-Select Indices Without Tears -- A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs -- A Framework for Vehicle Routing Approximation Schemes in Trees -- Avoidable Vertices and Edges in Graphs -- Plane Hop Spanners for Unit Disk Graphs -- On the Minimum Consistent Subset Problem -- Parameterized Complexity of Conict-free Graph Coloring -- Graph Isomorphism for (H1,H2)-Free Graphs: An Almost Complete Dichotomy -- Hamiltonicity for convex shape Delaunay and Gabriel graphs -- Computing Maximum Independent Set on Outerstring Graphs and Their Relatives -- Online Bin Covering with Advice -- Stackelberg Packing Games -- Range closest-pair search in higher dimensions -- Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles -- Kernelization of Graph Hamiltonicity: Proper H-Graphs -- Weighted Throughput Maximization with Calibrations -- Maximizing Dominance in the Plane and its Applications -- Extending Upward Planar Graph Drawings -- Online Circle Packing -- Guess Free Maximization of Submodular and Linear Sums -- Efficient Second-Order Shape-Constrained Function Fitting -- Dynamic Online Dictionary Matching -- Balanced Stable Marriage: How Close is Close Enough? -- Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint -- Inventory Routing Problem with Facility Location -- A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space -- Geometric Firefighting in the Half-plane -- Most vital segment barriers -- Splaying Preorders and Postorders -- Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS -- Discrete Morse Theory for Computing Zigzag Persistence -- Optimal Offline Dynamic 2,3-Edge/Vertex Connectivity -- Zip Trees -- Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points.
520 $a This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Numerical analysis. $3 527939
650 0 $a Computer graphics. $3 561602
650 0 $a Computer communication systems. $3 1115394
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Computer Graphics. $3 669895
650 2 4 $a Computer Communication Networks. $3 669310
700 1 $a Friggstad, Zachary. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1229184
700 1 $a Sack, Jörg-Rüdiger. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258919
700 1 $a Salavatipour, Mohammad R. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1229185
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030247652
776 0 8 $i Printed edition: $z 9783030247676
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-24766-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)