McCreesh, C. , Prosser, P. , Simpson, K. and Trimble, J. (2017) On Maximum Weight Clique Algorithms, and How They Are Evaluated. In: CP2017: The 23rd International Conference on Principles and Practice of Constraint Programming, Melbourne, Australia, 28 Aug - 1 Sept 2017, pp. 206-225. ISBN 9783319661575 (doi: 10.1007/978-3-319-66158-2_14)
|
Text
143720.pdf - Accepted Version 2MB |
Abstract
Maximum weight clique and maximum weight independent set solvers are often benchmarked using maximum clique problem instances, with weights allocated to vertices by taking the vertex number mod 200 plus 1. For constraint programming approaches, this rule has clear implications, favouring weight-based rather than degree-based heuristics. We show that similar implications hold for dedicated algorithms, and that additionally, weight distributions affect whether certain inference rules are cost-effective. We look at other families of benchmark instances for the maximum weight clique problem, coming from winner determination problems, graph colouring, and error-correcting codes, and introduce two new families of instances, based upon kidney exchange and the Research Excellence Framework. In each case the weights carry much more interesting structure, and do not in any way resemble the 200 rule. We make these instances available in the hopes of improving the quality of future experiments.
Item Type: | Conference Proceedings |
---|---|
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Trimble, Mr James and Prosser, Dr Patrick and Simpson, Dr Kyle and Mccreesh, Dr Ciaran |
Authors: | McCreesh, C., Prosser, P., Simpson, K., and Trimble, J. |
College/School: | College of Science and Engineering > School of Computing Science |
ISBN: | 9783319661575 |
Published Online: | 23 August 2017 |
Copyright Holders: | Copyright © 2017 Springer International Publishing AG |
First Published: | First published in Lecture Notes in Computer Science 10416 |
Publisher Policy: | Reproduced in accordance with the copyright policy of the publisher. |
Related URLs: |
University Staff: Request a correction | Enlighten Editors: Update this record