Del 14079 i serien Lecture Notes in Computer Science

Algorithms and Data Structures

18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings

Häftad, Engelska, 2023

1 779 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2023-07-28
Mått155 x 235 x 40 mm
Vikt1 095 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor721
FörlagSpringer International Publishing AG
ISBN9783031389054

Tillhör följande kategorier

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.

Du kanske också är intresserad av

Del 14079

Über die Natur der Dinge

Lukrez

Häftad, 2021

129 kr

Distributed Computing in Sensor Systems

Bhaskar Krishnamachari, Subhash Suri, Wendi Heinzelman, Urbashi Mitra

Häftad, 2009

729 kr

Algorithms and Computation

Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri

Häftad, 1996

749 kr

Open Data Structures

Pat Morin

Häftad, 2013

419 kr

Algorithms and Computation

Prosenjit K. Bose, Pat Morin

Häftad, 2002

729 kr

Nyhet

Del 11

Medusa

Lars Kepler

Inbunden, 2026

289 kr319 kr

Ruth Kvarnström-Jones - Systrarna på Sophiahemmet, Inbunden

Nyhet

Del 3

Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

299 kr329 kr

Sarah J. Maas - A Court of Splintered Harmony, Häftad

Nyhet

Del 6

A Court of Splintered Harmony

Sarah J. Maas

Häftad, 2026

259 kr

Nyhet

Threshing Day (Limited Deluxe Edition)

Rebecca Yarros

Inbunden, 2026

339 kr

Nyhet

Del 4

Sot

Sara Strömberg

Pocket, 2026

79 kr129 kr

Del 14079 i serien Lecture Notes in Computer Science

Algorithms and Data Structures

18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings

Häftad, Engelska, 2023

AvPat Morin,Subhash Suri

1 779 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum2023-07-28
Mått155 x 235 x 40 mm
Vikt1 095 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor721
FörlagSpringer International Publishing AG
ISBN9783031389054

Tillhör följande kategorier

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.

Du kanske också är intresserad av

Del 14079

Über die Natur der Dinge

Lukrez

Häftad, 2021

129 kr

Distributed Computing in Sensor Systems

Bhaskar Krishnamachari, Subhash Suri, Wendi Heinzelman, Urbashi Mitra

Häftad, 2009

729 kr

Algorithms and Computation

Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri

Häftad, 1996

749 kr

Open Data Structures

Pat Morin

Häftad, 2013

419 kr

Algorithms and Computation

Prosenjit K. Bose, Pat Morin

Häftad, 2002

729 kr

Nyhet

Del 11

Medusa

Lars Kepler

Inbunden, 2026

289 kr319 kr

Nyhet

Del 3

Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

299 kr329 kr

Nyhet

Del 6

A Court of Splintered Harmony

Sarah J. Maas

Häftad, 2026

259 kr

Nyhet

Threshing Day (Limited Deluxe Edition)

Rebecca Yarros

Inbunden, 2026

339 kr

Nyhet

Del 4

Sot

Sara Strömberg

Pocket, 2026

79 kr129 kr

Algorithms and Data Structures

18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av

Algorithms and Data Structures

18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av

Algorithms and Data Structures

18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Du kanske också är intresserad av