Approximations for the Steiner multicycle problem
From MaRDI portal
Publication:6634374
DOI10.1016/j.tcs.2024.114836MaRDI QIDQ6634374
Carla Negri Lintzmayer, Cristina G. Fernandes, Phablo F. S. Moura
Publication date: 7 November 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
combinatorial optimizationtraveling salesman problemapproximation algorithmscollaborative logisticsSteiner problems
Cites Work
- Unnamed Item
- Shipper collaboration
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Matching theory
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The Steiner cycle polytope
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- Randomized approximation scheme for Steiner multi cycle in the Euclidean plane
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- 8/7-approximation algorithm for (1,2)-TSP
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- 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
- A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
- Paths, Trees, and Flowers
- Max flows in O(nm) time, or better
- A Short Proof of the Factor Theorem for Finite Graphs
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
- Approximations for the Steiner multicycle problem
This page was built for publication: Approximations for the Steiner multicycle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6634374)
