國立高雄大學圖資館 |

Algorithms and data structures18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31-August 2, 2023 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithms and data structuresedited by Pat Morin, Subhash Suri.
Reminder of title:	18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31-August 2, 2023 : proceedings /
remainder title:	WADS 2023
other author:	Morin, Pat.
corporate name:
Published:	Cham :Springer Nature Switzerland :2023.
Description:	xii, 721 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Algorithms
Online resource:	https://doi.org/10.1007/978-3-031-38906-1
ISBN:	9783031389061$q(electronic bk.)

Algorithms and data structures18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31-August 2, 2023 : proceedings /
Algorithms and data structures18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31-August 2, 2023 : proceedings /[electronic resource] :WADS 2023edited by Pat Morin, Subhash Suri. - Cham :Springer Nature Switzerland :2023. - xii, 721 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,140790302-9743 ;. - Lecture notes in computer science ;4891..

Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs.

This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Data Structures, WADS 2023, held during July 31-August 2, 2023. The 47 regular papers, presented in this book, were carefully reviewed and selected from a total of 92 submissions. They present original research on the theory, design and application of algorithms and data structures.

ISBN: 9783031389061$q(electronic bk.)

Standard No.: 10.1007/978-3-031-38906-1doiSubjects--Topical Terms:

253943
Algorithms

LC Class. No.: QA76.9.D35

Dewey Class. No.: 005.73

Algorithms and data structures18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31-August 2, 2023 : proceedings /
LDR:04508nmm a2200373 a 4500 001 648413
003 DE-He213
005 20230727174738.0
006 m d
007 cr nn 008maaau
008 240116s2023 sz s 0 eng d
020 $a 9783031389061$q(electronic bk.)
020 $a 9783031389054$q(paper)
024 7 $a 10.1007/978-3-031-38906-1 $2 doi
035 $a 978-3-031-38906-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.D35
072 7 $a UMB $2 bicssc
072 7 $a GPF $2 bicssc
072 7 $a COM031000 $2 bisacsh
072 7 $a UMB $2 thema
072 7 $a GPF $2 thema
082 0 4 $a 005.73 $2 23
090 $a QA76.9.D35 $b I61 2023
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Algorithms and data structures $h [electronic resource] : $b 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31-August 2, 2023 : proceedings / $c edited by Pat Morin, Subhash Suri.
246 3 $a WADS 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a xii, 721 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 14079
505 0 $a Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs.
520 $a This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Data Structures, WADS 2023, held during July 31-August 2, 2023. The 47 regular papers, presented in this book, were carefully reviewed and selected from a total of 92 submissions. They present original research on the theory, design and application of algorithms and data structures.
650 0 $a Algorithms $3 253943
650 0 $a Data structures (Computer science) $3 183917
650 1 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Design and Analysis of Algorithms. $3 913142
650 2 4 $a Computer Engineering and Networks. $3 913124
650 2 4 $a Symbolic and Algebraic Manipulation. $3 273720
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Computer Graphics. $3 274515
700 1 $a Morin, Pat. $3 958130
700 1 $a Suri, Subhash. $3 958131
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-3-031-38906-1
950 $a Computer Science (SpringerNature-11645)