## An exact combinatorial algorithm for minimum graph bisection

- Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck
- Math. Program.
- 2015

Highly Influenced

@article{Hager2013AnEA, title={An exact algorithm for graph partitioning}, author={William W. Hager and Dzung T. Phan and Hongchao Zhang}, journal={Math. Program.}, year={2013}, volume={137}, pages={531-556} }

- Published 2013 in Math. Program.
DOI:10.1007/s10107-011-0503-x

An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained by decomposing the objective function into convex and concave parts and replacing the concave part by an affine underestimate. It is shown that the best affine underestimate can be expressed in terms of the center and the radius of the smallest sphere… CONTINUE READING

Highly Cited

This paper has 37 citations. REVIEW CITATIONS

Recent Discussions

This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

20 Citations

43 References

Similar Papers