Cover Image

Euclidean TSP in Narrow Strips

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alkema, Henk, de Berg, Mark, van der Hofstad, Remco, Kisfaludi-Bak, Sándor
Format:	Preprint
Published:	2020
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

Recognizing Subgraphs of Regular Tilings
by: Ingervo, Eliel, et al.
Published: (2026)

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

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

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

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

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

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

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

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

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

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

Percolation on random graphs
by: van der Hofstad, Remco
Published: (2025)

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

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

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

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

Balanced TSP partitioning
by: Berendsohn, Benjamin Aram, et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

Non-Euclidean Erdős-Anning Theorems
by: Eppstein, David
Published: (2024)

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

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

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

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

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

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

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