Algorithms and Data Structures 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings /
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 origin...
Պահպանված է:
| Համատեղ հեղինակ: | |
|---|---|
| Այլ հեղինակներ: | , |
| Ձևաչափ: | Էլեկտրոնային էլ․ գիրք |
| Լեզու: | անգլերեն |
| Հրապարակվել է: |
Cham :
Springer Nature Switzerland : Imprint: Springer,
2023.
|
| Հրատարակություն: | 1st ed. 2023. |
| Շարք: | Lecture Notes in Computer Science,
14079 |
| Խորագրեր: | |
| Առցանց հասանելիություն: | https://doi.org/10.1007/978-3-031-38906-1 |
| Ցուցիչներ: |
Ավելացրեք ցուցիչ
Չկան պիտակներ, Եղեք առաջինը, ով նշում է այս գրառումը!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-38906-1 | ||
| 003 | DE-He213 | ||
| 005 | 20260810170924.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 230727s2023 sz | o |||| 0|eng d | ||
| 020 | |a 9783031389061 |9 978-3-031-38906-1 | ||
| 024 | 7 | |a 10.1007/978-3-031-38906-1 |2 doi | |
| 050 | 4 | |a QA76.9.D35 | |
| 050 | 4 | |a Q350-390 | |
| 072 | 7 | |a UMB |2 bicssc | |
| 072 | 7 | |a GPF |2 bicssc | |
| 072 | 7 | |a COM021000 |2 bisacsh | |
| 072 | 7 | |a UMB |2 thema | |
| 072 | 7 | |a GPF |2 thema | |
| 082 | 0 | 4 | |a 005.73 |2 23 |
| 082 | 0 | 4 | |a 003.54 |2 23 |
| 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. |
| 250 | |a 1st ed. 2023. | ||
| 264 | 1 | |a Cham : |b Springer Nature Switzerland : |b Imprint: Springer, |c 2023. | |
| 300 | |a 1 online resource (XII, 721 p. 163 illus.). |b 121 illus. in color. | ||
| 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 Lecture Notes in Computer Science, |x 1611-3349 ; |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. | ||
| 588 | |a Print version record. | ||
| 650 | 0 | |a Data structures (Computer science). | |
| 650 | 0 | |a Information theory. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 0 | |a Computer engineering. | |
| 650 | 0 | |a Computer networks . | |
| 650 | 0 | |a Computer science |x Mathematics. | |
| 650 | 0 | |a Discrete mathematics. | |
| 650 | 0 | |a Computer graphics. | |
| 650 | 1 | 4 | |a Data Structures and Information Theory. |
| 650 | 2 | 4 | |a Design and Analysis of Algorithms. |
| 650 | 2 | 4 | |a Computer Engineering and Networks. |
| 650 | 2 | 4 | |a Symbolic and Algebraic Manipulation. |
| 650 | 2 | 4 | |a Discrete Mathematics in Computer Science. |
| 650 | 2 | 4 | |a Computer Graphics. |
| 700 | 1 | |a Morin, Pat. |e editor. |0 (orcid)0000-0003-0471-4118 |1 https://orcid.org/0000-0003-0471-4118 |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 700 | 1 | |a Suri, Subhash. |e editor. |4 edt |4 http://id.loc.gov/vocabulary/relators/edt | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031389054 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031389078 |
| 830 | 0 | |a Lecture Notes in Computer Science, |x 1611-3349 ; |v 14079 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-38906-1 |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 912 | |a ZDB-2-SXPS | ||
| 912 | |a ZDB-2-LNC | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||
| 950 | |a Springer Nature Proceedings Computer Science (SpringerNature-85344) | ||