Image de couverture de livre

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Le, Hung, Than, Cuong
Format:	Preprint
Publié:	2021
Sujets:	Computational Geometry I.3.5; F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Towards Instance-Optimal Euclidean Spanners
par: Le, Hung, et autres
Publié: (2024)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
par: Le, Hung, et autres
Publié: (2023)

Optimizing Visibility-based Search in Polygonal Domains
par: Huynh, Kien C., et autres
Publié: (2024)

Geometric Give and Take
par: Aichholzer, Oswin, et autres
Publié: (2026)

The Voronoi Diagram of Four Lines in $\mathbb{R}^3$
par: Papadopoulou, Evanthia, et autres
Publié: (2026)

The Rectilinear Marco Polo Problem
par: Gila, Ofek, et autres
Publié: (2025)

Approximating Euclidean Shallow-Light Trees
par: Le, Hung, et autres
Publié: (2025)

The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
par: Gila, Ofek, et autres
Publié: (2025)

The Presort Hierarchy for Geometric Problems
par: van der Hoog, Ivor, et autres
Publié: (2026)

When alpha-complexes collapse onto codimension-1 submanifolds
par: Attali, Dominique, et autres
Publié: (2024)

Finding Cliques in Geometric Intersection Graphs with Grounded or Stabbed Constraints
par: Keil, J. Mark, et autres
Publié: (2025)

Signotopes Induce Unique Sink Orientations on Grids
par: Roch, Sandro M.
Publié: (2026)

The Maximum Clique Problem in a Disk Graph Made Easy
par: Keil, J. Mark, et autres
Publié: (2024)

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
par: Agarwal, Pankaj K., et autres
Publié: (2018)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
par: Le, Hung, et autres
Publié: (2021)

Delaunay-like Triangulation of Smooth Orientable Submanifolds by L1-Norm Minimization
par: Attali, Dominique, et autres
Publié: (2022)

Ancestry Tree Clustering for Particle Filter Diversity Maintenance
par: Vallivaara, Ilari, et autres
Publié: (2025)

Continuous Flattening and Reversing of Convex Polyhedral Linkages
par: Demaine, Erik D., et autres
Publié: (2024)

Rotation-Invariant Vectorized Shape Representations
par: Shafieasl, Hamid, et autres
Publié: (2026)

Transitions in Dynamic Point Labeling
par: Depian, Thomas, et autres
Publié: (2022)

Test Case Features as Hyper-heuristics for Inductive Programming
par: McDaid, Edward, et autres
Publié: (2024)

Structural Tree Extraction from 3D Surfaces
par: de Andrade, Diogo, et autres
Publié: (2025)

Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of Euclidean spaces and of Riemannian manifolds
par: Attali, Dominique, et autres
Publié: (2022)

Instruction and Solution Probabilities as Heuristics for Inductive Programming
par: McDaid, Edward, et autres
Publié: (2025)

Generalized Voronoi Diagrams and Lie Sphere Geometry
par: Edwards, John, et autres
Publié: (2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
par: Aronov, Boris, et autres
Publié: (2024)

Improving Angular Speed Uniformity by Piecewise Radical Reparameterization
par: Hong, Hoon, et autres
Publié: (2024)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
par: de Rezende, Susanna F., et autres
Publié: (2019)

A technique for solving the polygon inclusion problems
par: Jin, Kai, et autres
Publié: (2017)

Constraints Matrices and Convergence Proof of TPMS2STEP
par: Zhao, Yaonaiming, et autres
Publié: (2024)

Translating TPMS models to STEP files
par: Zhao, Yaonaiming, et autres
Publié: (2024)

Liquid Amortization: Proving Amortized Complexity with LiquidHaskell (Functional Pearl)
par: van Brügge, Jan
Publié: (2024)

Apictorial Jigsaw Puzzle Reconstruction Based on Curve Matching via a Corotational Beam Spline
par: Orynyak, Igor, et autres
Publié: (2025)

Turnpike with Uncertain Measurements: Triangle-Equality ILP with a Deterministic Recovery Guarantee
par: Elder, C. S., et autres
Publié: (2026)

Faster, Deterministic and Space Efficient Subtrajectory Clustering
par: van der Hoog, Ivor, et autres
Publié: (2024)

Arrangements of Pseudocircles: On Digons and Triangles
par: Felsner, Stefan, et autres
Publié: (2022)

FaçAID: A Transformer Model for Neuro-Symbolic Facade Reconstruction
par: Plocharski, Aleksander, et autres
Publié: (2024)

Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays
par: Paoluzzi, Alberto, et autres
Publié: (2019)

Multi-scale Cycle Tracking in Dynamic Planar Graphs
par: Rasheed, Farhan, et autres
Publié: (2024)