1389 search results - page 62 / 278 » Improved Approximation Algorithms for Label Cover Problems |
138
Voted
SODA
2010
ACM
16 years 1 days ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
136
Voted
DASFAA
2004
IEEE
15 years 6 months ago
2004
IEEE
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
132
click to vote
AI
2001
Springer
15 years 7 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
139
Voted
ECCC
2000
15 years 2 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
106
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...