642 search results - page 5 / 129 » Approximation Algorithms for Minimum K-Cut |
101
click to vote
WDAG
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
SODA
1992
ACM
14 years 10 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...
91
Voted
ALGORITHMICA
2011
14 years 1 months ago
2011
SIAMCOMP
1998
14 years 9 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...