The capacitated max-k-cut problem

Authors:
Daya Ram Gaur;Ramesh Krishnamurti
Affiliations:
Department of Math & Computer Sc, University of Lethbridge, Lethbridge, AB;School of Computing Science, Simon Fraser University, Burnaby, BC
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 6
Cited 2

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
P-Complete Approximation Problems

Journal of the ACM (JACM)
Derandomizing Approximation Algorithms Based on Semidefinite Programming

SIAM Journal on Computing
Container ship stowage problem: complexity and connection to the coloring of circle graphs

Discrete Applied Mathematics
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms

Approximation algorithms

Dynamic entity distribution in parallel discrete event simulation

Proceedings of the 40th Conference on Winter Simulation
Conflict Resolution in the Scheduling of Television Commercials

Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.