3874 search results - page 141 / 775 » Approximation Algorithms for k-hurdle Problems |
84
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
127
click to vote
SODA
1992
ACM
15 years 2 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
135
click to vote
CCE
2005
15 years 1 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
110
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
95
Voted
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...