Document Open Access Logo

ILP-based Local Search for Graph Partitioning

Authors Alexandra Henzinger, Alexander Noe, Christian Schulz



PDF
Thumbnail PDF

File

LIPIcs.SEA.2018.4.pdf
  • Filesize: 0.55 MB
  • 15 pages

Document Identifiers

Author Details

Alexandra Henzinger
  • Stanford University, Stanford, CA, USA
Alexander Noe
  • University of Vienna, Vienna, Austria
Christian Schulz
  • University of Vienna, Vienna, Austria

Cite AsGet BibTex

Alexandra Henzinger, Alexander Noe, and Christian Schulz. ILP-based Local Search for Graph Partitioning. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 4:1-4:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.SEA.2018.4

Abstract

Computing high-quality graph partitions is a challenging problem with numerous applications. In this paper, we present a novel meta-heuristic for the balanced graph partitioning problem. Our approach is based on integer linear programs that solve the partitioning problem to optimality. However, since those programs typically do not scale to large inputs, we adapt them to heuristically improve a given partition. We do so by defining a much smaller model that allows us to use symmetry breaking and other techniques that make the approach scalable. For example, in Walshaw's well-known benchmark tables we are able to improve roughly half of all entries when the number of blocks is high.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph algorithms
  • Theory of computation → Integer programming
Keywords
  • Graph Partitioning
  • Integer Linear Programming

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. C. J. Alpert and A. B. Kahng. Recent Directions in Netlist Partitioning: A Survey. Integration, the VLSI Journal, 19(1-2):1-81, 1995. Google Scholar
  2. C. J. Alpert, A. B. Kahng, and S. Z. Yao. Spectral Partitioning with Multiple Eigenvectors. Discrete Applied Mathematics, 90(1):3-26, 1999. Google Scholar
  3. M. Armbruster. Branch-and-Cut for a Semidefinite Relaxation of Large-Scale Minimum Bisection Problems. PhD thesis, 2007. Google Scholar
  4. M. Armbruster, M. Fügenschuh, C. Helmberg, and A. Martin. A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. In Proc. of the 13th International Conference on Integer Programming and Combinatorial Optimization, volume 5035 of LNCS, pages 112-124. Springer, 2008. Google Scholar
  5. D. A. Bader, H. Meyerhenke, P. Sanders, C. Schulz, A. Kappes, and D. Wagner. Benchmarking for Graph Clustering and Partitioning. In Encyclopedia of Social Network Analysis and Mining, pages 73-82. Springer, 2014. Google Scholar
  6. C. Bichot and P. Siarry, editors. Graph Partitioning. Wiley, 2011. Google Scholar
  7. R. Brillout. A Multi-Level Framework for Bisection Heuristics. 2009. Google Scholar
  8. T. N. Bui and C. Jones. Finding Good Approximate Vertex and Edge Partitions is NP-Hard. Information Processing Letters, 42(3):153-159, 1992. Google Scholar
  9. A. Buluç, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz. Recent Advances in Graph Partitioning. In Algorithm Engineering, pages 117-158. Springer, 2016. Google Scholar
  10. T. Davis. The University of Florida Sparse Matrix Collection. Google Scholar
  11. D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck. Customizable Route Planning. In Proc. of the 10th International Symposium on Experimental Algorithms, volume 6630 of LCNS, pages 376-387. Springer, 2011. Google Scholar
  12. D. Delling, A. V. Goldberg, I. Razenshteyn, and R. F. Werneck. Exact Combinatorial Branch-and-Bound for Graph Bisection. In Proc. of the 12th Workshop on Algorithm Engineering and Experimentation (ALENEX'12), pages 30-44, 2012. Google Scholar
  13. D. Delling and R. F. Werneck. Better Bounds for Graph Bisection. In Proc. of the 20th European Symposium on Algorithms, volume 7501 of LNCS, pages 407-418, 2012. Google Scholar
  14. A. Feldmann and P. Widmayer. An O(n⁴) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. In Proc. of the 19th European Conference on Algorithms, volume 6942 of LNCS, pages 143-154. Springer, 2011. Google Scholar
  15. A. Felner. Finding Optimal Solutions to the Graph Partitioning Problem with Heuristic Search. Annals of Mathematics and Artificial Intelligence, 45:293-322, 2005. Google Scholar
  16. C. E. Ferreira, A. Martin, C. C. De Souza, R. Weismantel, and L. A. Wolsey. The Node Capacitated Graph Partitioning Problem: A Computational Study. Mathematical Programming, 81(2):229-256, 1998. Google Scholar
  17. C. M. Fiduccia and R. M. Mattheyses. A Linear-Time Heuristic for Improving Network Partitions. In Proc. of the 19th Conference on Design Automation, pages 175-181, 1982. Google Scholar
  18. J. Fietz, M. Krause, C. Schulz, P. Sanders, and V. Heuveline. Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries. In Proc. of Euro-Par 2012 Parallel Processing, volume 7484 of LNCS, pages 818-829. Springer, 2012. Google Scholar
  19. P. Galinier, Z. Boujbel, and M. C. Fernandes. An Efficient Memetic Algorithm for the Graph Partitioning Problem. Annals of Operations Research, 191(1):1-22, 2011. Google Scholar
  20. A. George. Nested Dissection of a Regular Finite Element Mesh. SIAM Journal on Numerical Analysis, 10(2):345-363, 1973. Google Scholar
  21. W. W. Hager, D. T. Phan, and H. Zhang. An Exact Algorithm for Graph Partitioning. Mathematical Programming, 137(1-2):531-556, 2013. URL: http://dx.doi.org/10.1007/s10107-011-0503-x.
  22. M. Hein and S. Setzer. Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts. In Advances in Neural Information Processing Systems, pages 2366-2374, 2011. Google Scholar
  23. A. Henzinger, A. Noe, and C. Schulz. ILP-based Local Search for Graph Partitioning. arXiv preprint arXiv:1802.07144, 2018. Google Scholar
  24. S. E. Karisch, F. Rendl, and J. Clausen. Solving Graph Bisection Problems with Semidefinite Programming. INFORMS Journal on Computing, 12(3):177-191, 2000. Google Scholar
  25. G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing, 20(1):359-392, 1998. Google Scholar
  26. B. W. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. The Bell System Technical Journal, 49(1):291-307, 1970. Google Scholar
  27. T. Kieritz, D. Luxen, P. Sanders, and C. Vetter. Distributed Time-Dependent Contraction Hierarchies. In Proc. of the 9th International Symposium on Experimental Algorithms, volume 6049 of LNCS, pages 83-93. Springer, 2010. Google Scholar
  28. A. H. Land and A. G. Doig. An Automatic Method of Solving Discrete Programming Problems. Econometrica, 28(3):497-520, 1960. Google Scholar
  29. U. Lauther. An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background, 2004. Google Scholar
  30. A. Lisser and F. Rendl. Graph Partitioning using Linear and Semidefinite Programming. Mathematical Programming, 95(1):91-101, 2003. URL: http://dx.doi.org/10.1007/s10107-002-0342-x.
  31. D. Luxen and D. Schieferdecker. Candidate Sets for Alternative Routes in Road Networks. In Proc. of the 11th International Symposium on Experimental Algorithms (SEA'12), volume 7276 of LNCS, pages 260-270. Springer, 2012. Google Scholar
  32. R. H. Möhring, H. Schilling, B. Schütz, D. Wagner, and T. Willhalm. Partitioning Graphs to Speedup Dijkstra’s Algorithm. Journal of Experimental Algorithmics (JEA), 11(2006), 2007. Google Scholar
  33. F. Pellegrini. Scotch Home Page. http://www. labri.fr/pelegrin/scotch.
  34. P. Sanders and C. Schulz. Engineering Multilevel Graph Partitioning Algorithms. In Proc. of the 19th European Symp. on Algorithms, volume 6942 of LNCS, pages 469-480. Springer, 2011. Google Scholar
  35. P. Sanders and C. Schulz. Distributed Evolutionary Graph Partitioning. In Proc. of the 12th Workshop on Algorithm Engineering and Experimentation (ALENEX'12), pages 16-29, 2012. Google Scholar
  36. P. Sanders and C. Schulz. Think Locally, Act Globally: Highly Balanced Graph Partitioning. In Proc. of the 12th Int. Symp. on Experimental Algorithms (SEA'13), LNCS. Springer, 2013. Google Scholar
  37. K. Schloegel, G. Karypis, and V. Kumar. Graph Partitioning for High Performance Scientific Simulations. In The Sourcebook of Parallel Computing, pages 491-541, 2003. Google Scholar
  38. C. Schulz and D. Strash. Graph Partitioning - Formulations and Applications to Big Data. In Encyclopedia on Big Data Technologies, 2018, to appear. Google Scholar
  39. M. Sellmann, N. Sensen, and L. Timajev. Multicommodity Flow Approximation used for Exact Graph Partitioning. In Proc. of the 11th European Symposium on Algorithms, volume 2832 of LNCS, pages 752-764. Springer, 2003. Google Scholar
  40. N. Sensen. Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows. In Proc. of the 9th European Symposium on Algorithms, volume 2161 of LNCS, pages 391-403. Springer, 2001. Google Scholar
  41. A. J. Soper, C. Walshaw, and M. Cross. A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning. Journal of Global Optimization, 29(2):225-241, 2004. Google Scholar
  42. C. Walshaw. Walshaw Partitioning Benchmark. http://staffweb.cms.gre.ac.uk/~wc06/partition/.
  43. C. Walshaw and M. Cross. JOSTLE: Parallel Multilevel Graph-Partitioning Software - An Overview. In Mesh Partitioning Techniques and Domain Decomposition Techniques, pages 27-58. 2007. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail