3875 search results - page 9 / 775 » Approximation Algorithms for the Max-coloring Problem |
IPCO
2001
13 years 8 months ago
2001
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...
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
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...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
SIAMCOMP
2008
13 years 7 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...