562 search results - page 3 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
FSTTCS
2004
Springer
14 years 13 days ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
SIAMCOMP
2011
12 years 10 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
AAIM
2008
Springer
13 years 9 months ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.