3874 search results - page 40 / 775 » Approximation Algorithms for k-hurdle Problems |
148
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
146
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
142
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
144
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
121
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...