3875 search results - page 42 / 775 » Approximation Algorithms for the Max-coloring Problem |
SODA
2000
ACM
13 years 10 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
COCO
2006
Springer
14 years 15 days ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
DAM
2007
13 years 8 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
CCCG
2010
13 years 10 months ago
2010
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
SODA
2010
ACM
14 years 6 months ago
2010
ACM