The \(m\)-Steiner traveling salesman problem with online edge blockages
From MaRDI portal
Publication:2045027
DOI10.1007/s10878-021-00720-6zbMath1473.90142OpenAlexW3139171943MaRDI QIDQ2045027
Publication date: 11 August 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00720-6
Related Items (2)
Online routing and searching on graphs with blocked edges ⋮ An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
Cites Work
- Unnamed Item
- Unnamed Item
- The Steiner traveling salesman problem with online edge blockages
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- Min-max tree covers of graphs.
- Shortest paths without a map
- A note on the \(k\)-Canadian traveller problem
- Approximation hardness of min-max tree covers
- The Canadian Traveller Problem and its competitive analysis
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- The Steiner traveling salesman problem with online advanced edge blockages
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
- The covering Canadian traveller problem
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- A Cutting Planes Algorithm for the m-Salesmen Problem
- The Traveling Salesman Problem with Distances One and Two
- Approximations for minimum and min-max vehicle routing problems
This page was built for publication: The \(m\)-Steiner traveling salesman problem with online edge blockages
