Imagen de Portada

Bicriteria approximation for minimum dilation graph augmentation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Buchin, Kevin, Buchin, Maike, Gudmundsson, Joachim, Wong, Sampson
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

Property Testing of Curve Similarity
por: Afshani, Peyman, et al.
Publicado: (2025)

Oriented Spanners
por: Buchin, Kevin, et al.
Publicado: (2023)

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

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

Compatible Triangulations of Simple Polygons
por: Afshani, Peyman, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

Minimum Exposure Motion Planning
por: de Berg, Sarita, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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