(p-1)/(p+1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective
From MaRDI portal
(Redirected from Publication:1363767)
\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
Recommendations
- Minmax \(p\)-traveling salesmen location problems on a tree
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
- Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
- scientific article; zbMATH DE number 1131767
Cites work
Cited in
(29)- Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
- Approximation hardness of min-max tree covers
- An overview of graph covering and partitioning
- Time versus cost tradeoffs for deterministic rendezvous in networks
- A note on the minimum bounded edge-partition of a tree
- Locating and repairing faults in a network with mobile agents
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- Map construction of unknown graphs by multiple agents
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Minmax Tree Cover in the Euclidean Space
- Remembering without memory: tree exploration by asynchronous oblivious robots
- scientific article; zbMATH DE number 7662164 (Why is no real title available?)
- Approximation results for min-max path cover problems in vehicle routing
- Efficient grid exploration with a stationary token
- How many oblivious robots can explore a line
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Approximation results for a min-max location-routing problem
- Minmax subtree cover problem on cacti
- Minmax \(p\)-traveling salesmen location problems on a tree
- A subexponential algorithm for the coloured tree partition problem
- The Traveler's Problem
- The ANTS problem
- A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
- On the uniform edge-partition of a tree
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
- Collective graph exploration parameterized by vertex cover
This page was built for publication: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363767)
