The Capacitated max-k-cut Problem
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 670-679
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming2001
- Container ship stowage problem: complexity and connection to the coloring of circle graphsDiscrete Applied Mathematics, 2000
- Derandomizing Approximation Algorithms Based on Semidefinite ProgrammingSIAM Journal on Computing, 1999
- Stowage planning for container ships to reduce the number of shiftsAnnals of Operations Research, 1998
- Improved approximation algorithms for MAXk-CUT and MAX BISECTIONAlgorithmica, 1997
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- P-Complete Approximation ProblemsJournal of the ACM, 1976