Cover Image

Bicriteria approximation for minimum dilation graph augmentation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Buchin, Kevin, Buchin, Maike, Gudmundsson, Joachim, Wong, Sampson
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
by: Buchin, Kevin, et al.
Published: (2024)

Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
by: Buchin, Kevin, et al.
Published: (2025)

A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
by: Buchin, Kevin, et al.
Published: (2026)

Faster Fréchet Distance under Transformations
by: Buchin, Kevin, et al.
Published: (2025)

Property Testing of Curve Similarity
by: Afshani, Peyman, et al.
Published: (2025)

Oriented Spanners
by: Buchin, Kevin, et al.
Published: (2023)

A well-separated pair decomposition for low density graphs
by: Gudmundsson, Joachim, et al.
Published: (2024)

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)

Linear time single-source shortest path algorithms in Euclidean graph classes
by: Gudmundsson, Joachim, et al.
Published: (2026)

Map matching queries on realistic input graphs under the Fréchet distance
by: Gudmundsson, Joachim, et al.
Published: (2022)

Geometric spanners of bounded tree-width
by: Buchin, Kevin, et al.
Published: (2024)

Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)

Approximating the Fréchet distance when only one curve is $c$-packed
by: Gudmundsson, Joachim, et al.
Published: (2024)

Computing $L_\infty$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness
by: Angrick, Sebastian, et al.
Published: (2026)

On Small Pair Decompositions for Point Sets
by: Buchin, Kevin, et al.
Published: (2026)

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
by: Abrahamsen, Mikkel, et al.
Published: (2025)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
by: Gudmundsson, Joachim, et al.
Published: (2021)

Spanner for the $0/1/\infty$ weighted region problem
by: Gudmundsson, Joachim, et al.
Published: (2024)

A WSPD, Separator and Small Tree Cover for c-packed Graphs
by: Deryckere, Lindsey, et al.
Published: (2025)

Minimum Exposure Motion Planning
by: de Berg, Sarita, et al.
Published: (2026)

Morphing Planar Graph Drawings Through 3D
by: Buchin, Kevin, et al.
Published: (2022)

Bicriteria Polygon Aggregation with Arbitrary Shapes
by: Blank, Lotte, et al.
Published: (2025)

Computing Planar Convex Hulls with a Promise
by: Aghamolaei, Sepideh, et al.
Published: (2026)

Shortest Paths of Mutually Visible Robots
by: Alsaedi, Rusul J., et al.
Published: (2023)

The Mutual Visibility Problem for Fat Robots with Lights
by: Alsaedi, Rusul J., et al.
Published: (2022)

Pattern Formation for Fat Robots with Lights
by: Alsaedi, Rusul J., et al.
Published: (2023)

Pattern Formation for Fat Robots with Memory
by: Alsaedi, Rusul J., et al.
Published: (2023)

Improving the average dilation of a metric graph by adding edges
by: Har-Peled, Sariel, et al.
Published: (2025)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
by: Gudmundsson, Joachim, et al.
Published: (2021)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
by: Gudmundsson, Joachim, et al.
Published: (2022)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
by: de Berg, Sarita, et al.
Published: (2026)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
by: Elbassioni, Khaled
Published: (2025)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
by: Akker, Erik van den, et al.
Published: (2024)

Integer points in dilates of polytopes
by: Saraf, Shubhangi, et al.
Published: (2025)

Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)

Instance-Optimal Imprecise Convex Hull
by: de Berg, Sarita, et al.
Published: (2025)

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation
by: van Renssen, Andrè, et al.
Published: (2022)

Theoretical analysis of beaconless geocast protocols in 1D
by: Gudmundsson, Joachim, et al.
Published: (2025)