Nonpolyhedral Relaxations of Graph-Bisection Problems

@article{Poljak1995NonpolyhedralRO,
  title={Nonpolyhedral Relaxations of Graph-Bisection Problems},
  author={Svatopluk Poljak and Franz Rendl},
  journal={SIAM Journal on Optimization},
  year={1995},
  volume={5},
  pages={467-487}
}
We study the problem of nding the minimum bisection of a graph into two parts of prescribed sizes. We formulate two lower bounds on the problem by relaxing node-and edge-incidence vectors of cuts. We prove that both relaxations provide the same bound. The main fact we prove is that the duality between the relaxed edge-and node-vectors preserves very natural cardinality constraints on cuts. We present an analogous result also for the max-cut problem, and show a relation between the edge… CONTINUE READING

From This Paper

Topics from this paper.
60 Citations
19 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 60 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…