220 search results - page 5 / 44 » Distributed Minimum Cut Approximation |
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
STOC
1995
ACM
14 years 1 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
DC
2008
13 years 10 months ago
2008
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...