On the Approximability of Maximum and Minimum Edge Clique Partition Problems

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson. On the Approximability of Maximum and Minimum Edge Clique Partition Problems. In Joachim Gudmundsson, C. Barry Jay, editors, Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings. Volume 51 of CRPIT, pages 101-105, Australian Computer Society, 2006. [doi]

Abstract

Abstract is missing.