43 search results - page 1 / 9 » Approximation of satisfactory bisection problems |
JCSS
2008
13 years 4 months ago
2008
FOCS
2000
IEEE
13 years 8 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...
COCOON
2005
Springer
13 years 9 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
ECCC
2002
13 years 4 months ago
2002
ECCC
2000
13 years 4 months ago
2000
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...