arXiv (All)
open access
A $(1+1/\sqrt{2})$-Approximation for the Multiple-Depot Traveling Salesman Problem
The metric traveling salesman problem (TSP) is a fundamental problem in combinatorial optimization that asks for a minimum-cost tour covering all clients in a metric graph. The metric multiple-depot TSP (MD-TSP) is a natural extension, where the graph contains depots and clients, and the objective i
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets#480082
- An Approximation Algorithm for Monotone Submodular Cost Allocation#1012077
- New algorithmic methods for real-time transportation problems#454317
- Dual-GNN Multilevel Coarsening for Maximum Independent Set#1051642
- Solving multi-depot closed-path multiple traveling salesman problem using k-means++ hierarchical clustering and neural combinatorial networks.#214202
Record · ID 1014130
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive