Skip to main content
Springer Nature Link
Log in

An Approximation Algorithm for Max p-Section

  • Conference paper
  • First Online:
STACS 99 (STACS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1563))

Included in the following conference series:

  • 1791 Accesses

Abstract

We present an approximation algorithm for the problem of partitioning the vertices of a weighted graph into p blocks of equal size so as to maximize the weight of the edges connecting different blocks. The algorithm is based on semidefinite programming and can in some sense be viewed as a generalization of the approximation algorithm by Frieze and Jerrum for the Max Bisection problem. Our algorithm, as opposed to that of Frieze and Jerrum, gives better performance than the naive randomized algorithm also for p > 2.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Noga Alon and Joel H. Spencer. The Probabilistic Method. Wiley, New York, 1992.

    MATH  Google Scholar 

  2. Gunnar Andersson, Lars Engebretsen, and Johan Håstad. A new way to use semidefinite programming with applications to linear equations mod p. In Proc. Tenth Ann. ACM-SIAM Symp. on Discrete Algorithms, 1999.

    Google Scholar 

  3. Alan Frieze and Mark Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. In Proc. 4th Conf. on Integer Prog. and Combinatorial Optimization, volume 920 of Lecture Notes in Comput. Sci., pages 1–13, Berlin, 1995. Springer-Verlag.

    Google Scholar 

  4. Michel X. Goemans and David P. Williamson. 878-approximation algorithms for MAX CUT and MAX 2SAT. In Proc. Twenty-sixth Ann. ACM Symp. on Theory of Comp., pages 422–431. ACM, New York, 1994.

    Chapter  Google Scholar 

  5. Johan Håstad. Some optimal inapproximability results. In Proc. Twenty-nineth Ann. ACM Symp. on Theory of Comp., pages 1–10. ACM, New York, 1997.

    Chapter  Google Scholar 

  6. Richard M. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, New York, NY, 1972.

    Google Scholar 

  7. Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, and David P. Williamson. Gadgets, approximation, and linear programming. In Proc. of 37th Ann. IEEE Symp. on Foundations of Comput. Sci., pages 617–626. IEEE Computer Society, Los Alamitos, 1996.

    Google Scholar 

  8. Uri Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proc. Nineth Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 201–210. ACM-SIAM, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Numerical Analysis and Computing Science, Royal Institute of Technology, SE-100 44, Stockholm, Sweden

    Gunnar Andersson

Authors
  1. Gunnar Andersson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. FB IV - Informatik, Universität Trier, D-54286, Trier, Germany

    Christoph Meinel

  2. LIFL, Université de Lille I, Bătiment 3, F-59655, Villeneuve d’Ascq Cedex, France

    Sophie Tison

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andersson, G. (1999). An Approximation Algorithm for Max p-Section. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-49116-3_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65691-3

  • Online ISBN: 978-3-540-49116-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics