3874 search results - page 158 / 775 » Approximation Algorithms for k-hurdle Problems |
138
click to vote
ECRTS
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
137
Voted
SIAMDM
2000
15 years 3 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
140
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
118
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
137
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...