Sciweavers

930 search results - page 7 / 186
» An Improved Approximation Algorithm for the Traveling Tourna...
Sort
View
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 9 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 10 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
14 years 7 days ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 8 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram