Pages that link to "Item:Q1119485"
From MaRDI portal
The following pages link to An approximation algorithm for the TSP (Q1119485):
Displaying 19 items.
- Improved solutions for the traveling purchaser problem. (Q1406699) (← links)
- Heuristics for the traveling purchaser problem (Q1870801) (← links)
- Analyzing the performance of TSP solver methods (Q2093970) (← links)
- Worst-case analysis of a new heuristic for the travelling salesman problem (Q2120141) (← links)
- An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
- T*: a weighted double-heuristic search algorithm to find the shortest path (Q2224337) (← links)
- The parameterized approximability of TSP with deadlines (Q2464332) (← links)
- TSP with bounded metrics (Q2495398) (← links)
- Approximation algorithms for TSP with neighborhoods in the plane (Q2768270) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems (Q3574304) (← links)
- Discrete online TSP (Q3638442) (← links)
- (Q4297219) (← links)
- (Q4472495) (← links)
- (Q5077643) (← links)
- Approximating TSP Solution by MST Based Graph Pyramid (Q5325746) (← links)
- Approximation Polynomial Algorithms for Some Modifications of TSP (Q5392089) (← links)
- THE TSP AND THE SUM OF ITS MARGINAL VALUES (Q5485789) (← links)
- A (slightly) improved approximation algorithm for metric TSP (Q6065169) (← links)