24 search results - page 5 / 5 » Minimum-Weight Cycle Covers and Their Approximability |
STACS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
CORR
2006
Springer
13 years 5 months 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...
SODA
1992
ACM
13 years 6 months ago
1992
ACM
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...
ISPASS
2003
IEEE
13 years 10 months ago
2003
IEEE
Video on Demand (VoD) services are very appealing these days. In this work, we discuss four distinct alternatives for the architecture of a VoD server and compare their performanc...