Imagen de Portada

A PTAS for Travelling Salesman Problem with Neighbourhoods Over Parallel Line Segments of Similar Length

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ghaseminia, Benyamin, Salavatipour, Mohammad R.
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

NP-hardness and a PTAS for the Euclidean Steiner Line Problem
por: Bartlmae, Simon, et al.
Publicado: (2024)

Time complexity of the Analyst's Traveling Salesman algorithm
por: Ramirez, Anthony, et al.
Publicado: (2022)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
por: Antoniadis, Antonios, et al.
Publicado: (2020)

Hitting Axis-Parallel Segments with Weighted Points
por: Raman, Rajiv, et al.
Publicado: (2026)

NP-Hardness and a PTAS for the Pinwheel Problem
por: Kleinberg, Robert, et al.
Publicado: (2026)

On the Line-Separable Unit-Disk Coverage and Related Problems
por: Liu, Gang, et al.
Publicado: (2023)

Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics
por: Ren, Kinter, et al.
Publicado: (2024)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
por: Liu, Gang, et al.
Publicado: (2024)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
por: Liu, Gang, et al.
Publicado: (2024)

A faster heuristic for the Traveling Salesman Problem with Drone
por: Hokama, Pedro H. D. B., et al.
Publicado: (2024)

Approximating Traveling Salesman Problems Using a Bridge Lemma
por: Böhm, Martin, et al.
Publicado: (2024)

Continuous Map Matching to Paths under Travel Time Constraints
por: Bosch, Yannick, et al.
Publicado: (2025)

Sliding Cubes in Parallel
por: Akitaya, Hugo A., et al.
Publicado: (2026)

Duality between Lines and Points
por: Saxena, Sanjeev
Publicado: (2025)

On Planar Straight-Line Dominance Drawings
por: Angelini, Patrizio, et al.
Publicado: (2025)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
por: Clementino, Thailsson, et al.
Publicado: (2025)

A QPTAS for Facility Location on Unit Disk graphs
por: Friggstad, Zachary, et al.
Publicado: (2024)

Dominance for Containment Problems
por: Akram, Waseem, et al.
Publicado: (2022)

Algorithms for Computing Closest Points for Segments
por: Wang, Haitao
Publicado: (2024)

Range Counting Oracles for Geometric Problems
por: Driemel, Anne, et al.
Publicado: (2025)

Algorithms for Halfplane Coverage and Related Problems
por: Wang, Haitao, et al.
Publicado: (2024)

C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
por: Philip, Allen George, et al.
Publicado: (2023)

On the Complexity of the Ordered Covering Problem in Distance Geometry
por: Souza, Michael, et al.
Publicado: (2025)

On Approximating the Weighted Region Problem in Square Tessellations
por: Kakimura, Naonori, et al.
Publicado: (2024)

Improved Algorithms for Distance Selection and Related Problems
por: Wang, Haitao, et al.
Publicado: (2023)

A PTAS for Weighted Triangle-free 2-Matching
por: Bosch-Calvo, Miguel, et al.
Publicado: (2026)

A Task-Parallel Approach for Localized Topological Data Structures
por: Liu, Guoxi, et al.
Publicado: (2023)

Parameterized Complexity of Directed Traveling Salesman Problem
por: Blažej, Václav, et al.
Publicado: (2025)

A Survey of Approximability Results for Traveling Salesman Problems using the TSP-T3CO Definition Scheme
por: Saller, Sophia, et al.
Publicado: (2023)

Single-Source Shortest Path Problem in Weighted Disk Graphs
por: An, Shinwoo, et al.
Publicado: (2025)

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

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
por: Marin, Malory, et al.
Publicado: (2025)

Optimizing Line Segment Inspection with Limited-Range Drones
por: Díaz-Báñez, José-Miguel, et al.
Publicado: (2026)

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
por: Kar, Debajyoti, 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)

The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
por: Afshani, Peyman, et al.
Publicado: (2026)

Single-Criteria Metric $r$-Dominating Set Problem via Minor-Preserving Support
por: Browne, Reilly, et al.
Publicado: (2026)

A Simple PTAS for Weighted $k$-means and Sensor Coverage
por: Pareek, Akash, et al.
Publicado: (2025)

Rectangle Tiling Binary Arrays
por: Ghosal, Pratik, et al.
Publicado: (2020)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
por: Bhore, Sujoy, et al.
Publicado: (2024)