On the Approximability of Maximum and Minimum Edge Clique Partition Problems - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Anders Dessmark' in GoogleThis author has not been identified. Look up 'Jesper Jansson' in GoogleThis author has not been identified. Look up 'Andrzej Lingas' in GoogleThis author has not been identified. Look up 'Eva-Marta Lundell' in GoogleThis author has not been identified. Look up 'Mia Persson' in Google

runs on WebDSL