7150 search results - page 56 / 1430 » An Approximation Algorithm for Approximation Rank |
131
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
106
click to vote
CORR
2006
Springer
15 years 17 days ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
100
Voted
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
CORR
2006
Springer
15 years 17 days ago
2006
Springer
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...
118
Voted
ICCSA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...