3874 search results - page 286 / 775 » Approximation Algorithms for k-hurdle Problems |
130
click to vote
INFORMS
2000
15 years 4 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
163
Voted
TEC
2008
15 years 4 months ago
2008
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
129
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
126
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
132
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...