國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithms and data structures16th I...

(1998 :)

Algorithms and data structures16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms and data structuresedited by Zachary Friggstad, Jorg-Rudiger Sack, Mohammad R Salavatipour.
其他題名:	16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019 : proceedings /
其他題名:	WADS 2019
其他作者:	Friggstad, Zachary.
團體作者:
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	xx, 594 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Algorithms
電子資源:	https://doi.org/10.1007/978-3-030-24766-9
ISBN:	9783030247669$q(electronic bk.)

Algorithms and data structures16th 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] :WADS 2019edited by Zachary Friggstad, Jorg-Rudiger Sack, Mohammad R Salavatipour. - Cham :Springer International Publishing :2019. - xx, 594 p. :ill., digital ;24 cm. - Lecture notes in computer science,116460302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

253943
Algorithms

LC Class. No.: QA76.9.D35

Dewey Class. No.: 005.73

Algorithms and data structures16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019 : proceedings /
LDR:04102nmm a2200361 a 4500 001 563727
003 DE-He213
005 20190712192335.0
006 m d
007 cr nn 008maaau
008 200311s2019 gw s 0 eng d
020 $a 9783030247669$q(electronic bk.)
020 $a 9783030247652$q(paper)
024 7 $a 10.1007/978-3-030-24766-9 $2 doi
035 $a 978-3-030-24766-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.D35
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.73 $2 23
090 $a QA76.9.D35 $b I61 2019
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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, Jorg-Rudiger Sack, Mohammad R Salavatipour.
246 3 $a WADS 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xx, 594 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11646
490 1 $a Theoretical computer science and general issues
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 253943
650 0 $a Data structures (Computer science) $3 183917
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Numeric Computing. $3 275524
650 2 4 $a Computer Graphics. $3 274515
650 2 4 $a Computer Communication Networks. $3 218087
700 1 $a Friggstad, Zachary. $3 849347
700 1 $a Sack, Jorg-Rudiger. $3 284953
700 1 $a Salavatipour, Mohammad R. $3 849348
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-24766-9
950 $a Computer Science (Springer-11645)