Skip to main content
SpringerLink
Log in

The Capacitated max-k-cut Problem

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

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

Included in the following conference series:

Abstract

In this paper we study a capacitated version of the classical max-k-cut problem. Given a graph we are to partition the vertices into k equal-sized sets such that the number of edges across the sets is maximized. We present a deterministic approximation algorithm for this problem with performance ratio (k – 1) / k. Our algorithm is based on local search, a technique that has been applied to a variety of combinatorial optimization problems.

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 139.00
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.

References

  1. Avriel, M., Penn, M., Shpirer, N.: Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discrete Appl. Math. 103(1-3), 271–279 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Annals of Operations Research 76, 55–71 (1998)

    Article  MATH  Google Scholar 

  3. Frieze, A., Jerrum, M.: Improved approximation algorithms for max k-cut and max bisection. Algorithmica 18(1), 67–81 (1997)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Goemans, M., Williamson, D.: Approximation algorithms for max-3-cut and other problems via complex semidefinite programming. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 443–452. ACM Press, New York (2001)

    Chapter  Google Scholar 

  6. Mahajan, S., Ramesh, H.: Derandomizing approximation algorithms based on semidefinite programming. SIAM Journal on Computing 5, 1641–1663 (1999)

    Article  MathSciNet  Google Scholar 

  7. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  8. Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23, 555–565 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  9. Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Math & Computer Sc, University of Lethbridge, Lethbridge, AB, T1K 4G9

    Daya Ram Gaur

  2. School of Computing Science, Simon Fraser University, Burnaby, BC, V5A 1S6

    Ramesh Krishnamurti

Authors
  1. Daya Ram Gaur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ramesh Krishnamurti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gaur, D.R., Krishnamurti, R. (2005). The Capacitated max-k-cut Problem. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_71

Download citation

  • DOI: https://doi.org/10.1007/11424925_71

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation