000 | 05834nam a22006975i 4500 | ||
---|---|---|---|
001 | 978-3-031-38906-1 | ||
003 | DE-He213 | ||
005 | 20240423125316.0 | ||
007 | cr nn 008mamaa | ||
008 | 230727s2023 sz | s |||| 0|eng d | ||
020 |
_a9783031389061 _9978-3-031-38906-1 |
||
024 | 7 |
_a10.1007/978-3-031-38906-1 _2doi |
|
050 | 4 | _aQA76.9.D35 | |
050 | 4 | _aQ350-390 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aGPF _2bicssc |
|
072 | 7 |
_aCOM021000 _2bisacsh |
|
072 | 7 |
_aUMB _2thema |
|
072 | 7 |
_aGPF _2thema |
|
082 | 0 | 4 |
_a005.73 _223 |
082 | 0 | 4 |
_a003.54 _223 |
245 | 1 | 0 |
_aAlgorithms and Data Structures _h[electronic resource] : _b18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / _cedited by Pat Morin, Subhash Suri. |
250 | _a1st ed. 2023. | ||
264 | 1 |
_aCham : _bSpringer Nature Switzerland : _bImprint: Springer, _c2023. |
|
300 |
_aXII, 721 p. 163 illus., 121 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v14079 |
|
505 | 0 | _aGeometric 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 | _aThis 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 | _aData structures (Computer science). | |
650 | 0 | _aInformation theory. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aComputer engineering. | |
650 | 0 | _aComputer networks . | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aComputer graphics. | |
650 | 1 | 4 | _aData Structures and Information Theory. |
650 | 2 | 4 | _aDesign and Analysis of Algorithms. |
650 | 2 | 4 | _aComputer Engineering and Networks. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aComputer Graphics. |
700 | 1 |
_aMorin, Pat. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aSuri, Subhash. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783031389054 |
776 | 0 | 8 |
_iPrinted edition: _z9783031389078 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v14079 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-38906-1 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c176541 _d176541 |