192 search results - page 2 / 39 » A Constant-Factor Approximation Algorithm for the Multicommo... |
STOC
2000
ACM
13 years 9 months ago
2000
ACM
STOC
2003
ACM
14 years 4 months ago
2003
ACM
SIAMCOMP
1998
13 years 4 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...
WADS
2007
Springer
13 years 10 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...