642 search results - page 5 / 129 » Approximation Algorithms for Minimum K-Cut |
148
click to vote
WDAG
2010
Springer
15 years 1 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
15 years 4 months ago
2003
ACM
139
click to vote
SODA
1992
ACM
15 years 4 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...
117
click to vote
SIAMCOMP
1998
15 years 2 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...