626 search results - page 1 / 126 » On Approximability of Minimum Bisection Problem |
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
ECCC
2002
13 years 4 months ago
2002
IPCO
2008
13 years 6 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
STOC
1995
ACM
13 years 8 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,...
SPAA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...