:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Alkema, Henk, de Berg, Mark, van der Hofstad, Remco, Kisfaludi-Bak, Sándor
Formato:	Preprint
Publicado:	2020
Materias:	Computational Geometry
Acceso en línea:	https://arxiv.org/abs/2003.09948
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2020)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2026)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
por: de Berg, Mark, et al.
Publicado: (2026)

Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2026)

A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2023)

Near-Optimal Dynamic Steiner Spanners for Constant-Curvature Spaces
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)

Recognizing Subgraphs of Regular Tilings
por: Ingervo, Eliel, et al.
Publicado: (2026)

Realizing Metric Spaces with Convex Obstacles
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)

Shortest Paths, Convexity, and Treewidth in Regular Hyperbolic Tilings
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)

Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity
por: Bhore, Sujoy, et al.
Publicado: (2026)

Structure and Independence in Hyperbolic Uniform Disk Graphs
por: Bläsius, Thomas, et al.
Publicado: (2024)

Faster Approximation Scheme for Euclidean $k$-TSP
por: van Wijland, Ernest, et al.
Publicado: (2023)

Touring a Sequence of Orthogonal Polygons
por: Casel, Katrin, et al.
Publicado: (2026)

Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
por: Chan, Timothy M., et al.
Publicado: (2026)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
por: Chan, Timothy M., et al.
Publicado: (2026)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
por: Chan, Timothy M., et al.
Publicado: (2025)

Percolation on random graphs
por: van der Hofstad, Remco
Publicado: (2025)

The giant in random graphs is almost local
por: van der Hofstad, Remco
Publicado: (2021)

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers
por: Gaudio, Julia, et al.
Publicado: (2026)

Improved Bounds for Discrete Voronoi Games
por: de Berg, Mark, et al.
Publicado: (2026)

Approximation and Hardness of Polychromatic TSP
por: Schibler, Thomas, et al.
Publicado: (2025)

Bollobás-Meir TSP Conjecture Holds Asymptotically
por: Gordeev, Alexey
Publicado: (2026)

Balanced TSP partitioning
por: Berendsohn, Benjamin Aram, et al.
Publicado: (2025)

Simpler and Faster Contiguous Art Gallery
por: de Berg, Sarita, et al.
Publicado: (2025)

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
por: de Berg, Mark, et al.
Publicado: (2025)

On Stable Approximation Algorithms for Geometric Coverage Problems
por: de Berg, Mark, et al.
Publicado: (2024)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
por: de Berg, Mark, et al.
Publicado: (2024)

Long-range first-passage percolation on the torus
por: van der Hofstad, Remco, et al.
Publicado: (2023)

Logarithmic typical distances in preferential attachment models
por: van der Hofstad, Remco, et al.
Publicado: (2025)

Connectivity of random graphs after centrality-based vertex removal
por: Pandey, Manish, et al.
Publicado: (2023)

Are giants in random digraphs `almost' local?
por: van der Hofstad, Remco, et al.
Publicado: (2024)

Ising model on preferential attachment models
por: van der Hofstad, Remco, et al.
Publicado: (2025)

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

Universal Collection of Euclidean Invariants between Pairs of Position-Orientations
por: Bellaard, Gijs, et al.
Publicado: (2025)

Connected Components on Lie Groups and Applications to Multi-Orientation Image Analysis
por: Berg, Nicky J. van den, et al.
Publicado: (2024)

On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
por: de Berg, Mark, et al.
Publicado: (2026)

Simpler is Faster: Practical Distance Reporting by Sorting Along a Space-Filling Curve
por: de Berg, Sarita, et al.
Publicado: (2025)

Distinct Distances Between a Line and Strip
por: Das, Sanjana, et al.
Publicado: (2025)

The Contiguous Art Gallery Problem is in Θ(n log n)
por: de Berg, Sarita, et al.
Publicado: (2025)

Random cluster models on random graphs
por: Can, Van Hao, et al.
Publicado: (2025)