Better bounds for graph bisection

Authors:
Daniel Delling;Renato F. Werneck
Affiliations:
Microsoft Research Silicon Valley;Microsoft Research Silicon Valley
Venue:
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Year:
2012

Citing 12
Cited 0

Graph bisection algorithms with good average case behavior

Combinatorica
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
A branch-and-cut algorithm for the equicut problem

Mathematical Programming: Series A and B
The node capacitated graph partitioning problem: a computational study

Mathematical Programming: Series A and B - Special issue on computational integer programming
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Solving Graph Bisection Problems with Semidefinite Programming

INFORMS Journal on Computing
Efficient traversal of mesh edges using adjacency primitives

ACM SIGGRAPH Asia 2008 papers
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

Mathematical Programming: Series A and B
A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines

IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce new lower bounds for the minimum graph bisection problem. Within a branch-and-bound framework, they enable the solution of a wide variety of instances with tens of thousands of vertices to optimality. Our algorithm compares favorably with the best previous approaches, solving long-standing open instances in minutes.