Searching for "Traveling salesman path problems." – sorted by Relevance.
16 documents found, showing 1 through 10.
Next 10 →
-
The Directed Minimum Latency Problem
- … ), where ρ is the integrality gap of an LP relaxation for the asymmetric traveling salesman path problem…
- Add To MetaCart
-
A push-relabel algorithm for approximating degree-bounded spanning trees
- … several combinatorial problems, including the Traveling Salesman Path Problem (TSPP). An (α, f…
- Cited by 4 (3 self) – Add To MetaCart
-
The London Internet Exchange (LINX), “Memorandum of understanding,” http://www.linx.net/joining/mou.thtml
- …An ����� �� Approximation Ratio for the Asymmetric Traveling Salesman Path Problem Chandra Chekuri…
- Cited by 5 (0 self) – Add To MetaCart
-
Traveling salesman-based curve reconstruction in polynomial time
- … salesman tour (path) solves the curve reconstruction problem. • We show that an extension of the traveling…
- Cited by 5 (1 self) – Add To MetaCart
-
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman
- … to three closely related problems: the traveling salesman path problem (TSPP), the stacker crane problem…
- Cited by 3 (0 self) – Add To MetaCart
-
Robust Multirobot Coordination in Dynamic Environments
- … as the multi-depot traveling salesman path problem (MD-TSPP). The tasks can be considered as cities…
- Cited by 18 (4 self) – Add To MetaCart
-
A Versatile Implementation of the Traderbots Approach for MultiRobot Coordination
- …-depot traveling salesman path problem (MD-TSPP). The tasks can be considered as cities to be visited where…
- Cited by 14 (4 self) – Add To MetaCart
-
What would edmonds do? augmenting paths and witnesses for bounded degree msts
- … spanning tree respecting the given degree bounds. This problem generalizes the Travelling Salesman Path…
- Cited by 9 (3 self) – Add To MetaCart
-
Market-Based Approaches for Coordination of Multi-Robot Teams at Different Granularities of
- … as the multi-depot traveling salesman path problem (MD-TSPP). The tasks can be modeled as cities to be visited…
- Cited by 5 (0 self) – Add To MetaCart
-
The N-line Traveling Salesman Problem
- … the Traveling Salesman Path Problem. A similar but easier special case was considered by Ratliff and Rosenthal…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
