Image de couverture de livre

Computing Oriented Spanners and their Dilation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Buchin, Kevin, Kalb, Antonia, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Rehs, Carolin, Wong, Sampson
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Oriented Spanners
par: Buchin, Kevin, et autres
Publié: (2023)

On Small Pair Decompositions for Point Sets
par: Buchin, Kevin, et autres
Publié: (2026)

Geometric spanners of bounded tree-width
par: Buchin, Kevin, et autres
Publié: (2024)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
par: Biniaz, Ahmad, et autres
Publié: (2024)

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
par: Buchin, Kevin, et autres
Publié: (2024)

Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
par: Buchin, Kevin, et autres
Publié: (2025)

Bicriteria approximation for minimum dilation graph augmentation
par: Buchin, Kevin, et autres
Publié: (2024)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
par: Chung, Chaeyoon, et autres
Publié: (2026)

A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
par: Buchin, Kevin, et autres
Publié: (2026)

Euclidean Maximum Matchings in the Plane---Local to Global
par: Biniaz, Ahmad, et autres
Publié: (2024)

Faster Fréchet Distance under Transformations
par: Buchin, Kevin, et autres
Publié: (2025)

Compatible Triangulations of Simple Polygons
par: Afshani, Peyman, et autres
Publié: (2026)

Noncrossing Longest Paths and Cycles
par: Aloupis, Greg, et autres
Publié: (2024)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
par: Biniaz, Ahmad, et autres
Publié: (2025)

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
par: Abrahamsen, Mikkel, et autres
Publié: (2025)

Contiguous Boundary Guarding
par: Biniaz, Ahmad, et autres
Publié: (2024)

Property Testing of Curve Similarity
par: Afshani, Peyman, et autres
Publié: (2025)

Spanner for the $0/1/\infty$ weighted region problem
par: Gudmundsson, Joachim, et autres
Publié: (2024)

Polychromatic Coloring of Tuples in Hypergraphs
par: Biniaz, Ahmad, et autres
Publié: (2025)

Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
par: Bhore, Sujoy, et autres
Publié: (2026)

Deciding if a DAG is Interesting is Hard
par: De Carufel, Jean-Lou, et autres
Publié: (2025)

Computing $L_\infty$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness
par: Angrick, Sebastian, et autres
Publié: (2026)

Orienteering (with Time Windows) on Restricted Graph Classes
par: Buchin, Kevin, et autres
Publié: (2024)

Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)

A well-separated pair decomposition for low density graphs
par: Gudmundsson, Joachim, et autres
Publié: (2024)

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
par: Abrahamsen, Mikkel, et autres
Publié: (2024)

Computing shortest paths amid non-overlapping weighted disks
par: Bose, Prosenjit, et autres
Publié: (2024)

Online Class Cover Problem
par: De, Minati, et autres
Publié: (2023)

Generalized Sweeping Line Spanners
par: Lee, Keenan, et autres
Publié: (2021)

Dependable Spanners via Unreliable Edges
par: Har-Peled, Sariel, et autres
Publié: (2024)

Approximating the Fréchet distance when only one curve is $c$-packed
par: Gudmundsson, Joachim, et autres
Publié: (2024)

Linear time single-source shortest path algorithms in Euclidean graph classes
par: Gudmundsson, Joachim, et autres
Publié: (2026)

Computing Planar Convex Hulls with a Promise
par: Aghamolaei, Sepideh, et autres
Publié: (2026)

The Complexity of Geodesic Spanners
par: de Berg, Sarita, et autres
Publié: (2023)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
par: Bhore, Sujoy, et autres
Publié: (2024)

Hop-Spanners for Geometric Intersection Graphs
par: Conroy, Jonathan B., et autres
Publié: (2021)

Map matching queries on realistic input graphs under the Fréchet distance
par: Gudmundsson, Joachim, et autres
Publié: (2022)

Completely Independent Steiner Trees
par: Maheshwari, Anil, et autres
Publié: (2026)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
par: Buchin, Kevin, et autres
Publié: (2026)

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
par: Dutta, Madhura, et autres
Publié: (2025)