511 search results - page 2 / 103 » TSP with bounded metrics |
TSP
2008
13 years 4 months ago
2008
Abstract--This paper reports an upper bound for the Kullback
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
TSP
2010
12 years 11 months ago
2010
Abstract--Ziv
CIAC
2003
Springer
13 years 8 months ago
2003
Springer
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...