Approximations for the Steiner multicycle problem
From MaRDI portal
Publication:6109004
DOI10.1007/978-3-031-20624-5_12arXiv2308.07471MaRDI QIDQ6109004
Phablo F. S. Moura, Carla Negri Lintzmayer, Cristina G. Fernandes
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2308.07471
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Shipper collaboration
- A factor 2 approximation algorithm for the generalized Steiner network problem
- An extension of matching theory
- Matching theory
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The Steiner cycle polytope
- Randomized approximation scheme for Steiner multi cycle in the Euclidean plane
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- 8/7-approximation algorithm for (1,2)-TSP
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- The Traveling Salesman Problem with Distances One and Two
- Matching, Euler tours and the Chinese postman
- A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
- New Approximation Algorithms for (1,2)-TSP
- Paths, Trees, and Flowers
- A Short Proof of the Factor Theorem for Finite Graphs
