Skip to main content
SpringerLink
Log in

An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems

  • Conference paper
Computing and Combinatorics (COCOON 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7936))

Included in the following conference series:

Abstract

We present a unified semidefinite programming hierarchies rounding approximation algorithm for a class of maximum graph bisection problems with improved approximation ratios.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Austrin, P., Benabbas, S., Georgiou, K.: Better balance by being biased: a 0.8776-approximation for max bisection. In: Proceedings of SODA, pp. 277–294 (2013), Full version available as arXiv eprint 1205.0458v2

    Google Scholar 

  2. Feige, U., Langberg, M.: The RPR2 rounding technique for semidefinite programs. Journal of Algorithms 60, 1–23 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Frieze, A.M., Jerrum, M.: Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18, 67–81 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42, 1115–1145 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  5. Halperin, E., Zwick, U.: A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Structures & Algorithms 20, 382–402 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Han, Q., Ye, Y., Zhang, J.: An improved rounding method and semidefinite programming relaxation for graph partition. Mathematical Programming, Series B 92, 509–535 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lasserre, J.B.: An explicit equivalent positive semidefinite program for nonlinear 0-1 programs. SIAM Journal on Optimization 12, 756–769 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Raghavendra, P., Tan, N.: Approximating CSPs with global cardinality constraints using SDP hierarchies. In: Proceedings of SODA, pp. 373–387 (2012), Full version available as arXiv eprint 1110.1064v1

    Google Scholar 

  9. Xu, D., Han, J., Huang, Z., Zhang, L.: Improved approximation algorithms for MAX n/2-DIRECTED-BISECTION and MAX n/2-DENSE-SUBGRAPH. Journal of Global Optimization 27, 399–410 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ye, Y.: A .699-approximation algorithm for Max-Bisection. Mathematical Programming 90, 101–111 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Nankai University, Tianjin, 300071, P.R. China

    Chenchen Wu

  2. Faculty of Business Administration, University of New Brunswick, NB, Canada Fredericton, E3B 9Y2

    Donglei Du

  3. Department of Applied Mathematics, Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing, 100124, P.R. China

    Dachuan Xu

Authors
  1. Chenchen Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Donglei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dachuan Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ding-Zhu Du

  2. College of Computer Science and Technology, Zhejiang University, 310027, Hangzhou, China

    Guochuan Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, C., Du, D., Xu, D. (2013). An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38768-5_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38767-8

  • Online ISBN: 978-3-642-38768-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation