Advertisement

A spectral partitioning algorithm for maximum directed cut problem

  • Zhenning Zhang
  • Donglei Du
  • Chenchen Wu
  • Dachuan Xu
  • Dongmei ZhangEmail author
Article
  • 8 Downloads

Abstract

We investigate the maximum directed cut (MaxDC) problem by designing a spectral partitioning algorithm. Given a directed graph with nonnegative arc weights, we wish to obtain a bipartition of the vertices such that the total weight of the directed cut arcs is maximized. Relaxing the MaxDC problem as a quadratic program allows us to explore combinatorial properties of the optimal solution, leading to a 0.272-approximation algorithm via the technique of spectral partitioning rounding.

Keywords

Maximum directed cut Spectral graph theory Spectral partitioning rounding Approximation algorithm 

Notes

Acknowledgements

The first author is supported by Beijing Excellent Talents Funding (No. 201400 0020124G046), and General Science and Technology Project of Beijing Municipal Education Commission (No. KM201810005006). The second author’s research is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) Grant 06446, and NSFC (Nos. 11771386 and 11728104). The third author’s research is supported by NSFC (No. 11501412). The fourth author’s research is supported by NSFC (Nos. 11531014 and 11871081). The fifth author is supported by Higher Educational Science and Technology Program of Shandong Province (No. J15LN22).

References

  1. Beckenbach E, Bellman R (1961) An introduction to inequalities. Random House, New YorkzbMATHGoogle Scholar
  2. Feige U, Jozeph S (2015) Oblivious algorithms for the maximum directed cut problem. Algorithmica 71:409–428MathSciNetCrossRefGoogle Scholar
  3. Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42:1115–1145MathSciNetCrossRefGoogle Scholar
  4. Kale S, Seshadhri C (2010) Combinatorial approximation algorithms for MaxCut using random walks (preprint). arXiv:1008.3938
  5. Lewin M, Livnat D, Zwick U (2002) Improved rounding techniques for the MAX \(2\)-SAT and MAX DI-CUT problems. In: Proceedings of the 9th international conference on integer programming and combinatorial optimization, pp 67–82Google Scholar
  6. Nikiforov V (2016) Max \(k\)-cut and the smallest eigenvalue. Linear Algebra Appl 504:462–467MathSciNetCrossRefGoogle Scholar
  7. Soto A (2015) Improved analysis of Max-Cut algorithm based on spectral partitioning. SIAM J Discrete Math 29:259–268MathSciNetCrossRefGoogle Scholar
  8. Trevisan L (2012) Max cut and the smallest eigenvalue. SIAM J Comput 41:1769–1786MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  • Zhenning Zhang
    • 1
  • Donglei Du
    • 2
  • Chenchen Wu
    • 3
  • Dachuan Xu
    • 1
  • Dongmei Zhang
    • 4
    Email author
  1. 1.College of Applied SciencesBeijing University of TechnologyBeijingPeople’s Republic of China
  2. 2.Faculty of Business AdministrationUniversity of New BrunswickFrederictonCanada
  3. 3.College of ScienceTianjin University of TechnologyTianjinPeople’s Republic of China
  4. 4.School of Computer Science and TechnologyShandong Jianzhu UniversityJinanPeople’s Republic of China

Personalised recommendations