Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/129712
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | Infra-chromatic bound for exact maximum clique search |
Autor: | San Segundo Carrillo, Pablo CSIC ORCID; Nikolaev, A.; Batsyn, M. | Palabras clave: | Branch-and-bound MaxSAT Combinatorial optimization Approximate coloring |
Fecha de publicación: | 2015 | Editor: | Pergamon Press | Citación: | Computers and Operations Research 64: 293- 303 (2015) | Resumen: | © 2015 Elsevier Ltd. All rights reserved. Many efficient exact branch and bound maximum clique solvers use approximate coloring to compute an upper bound on the clique number for every subproblem. This technique reasonably promises tight bounds on average, but never tighter than the chromatic number of the graph. Li and Quan, 2010, AAAI Conference, p. 128-133 describe a way to compute even tighter bounds by reducing each colored subproblem to maximum satisfiability problem (MaxSAT). Moreover they show empirically that the new bounds obtained may be lower than the chromatic number. Based on this idea this paper shows an efficient way to compute related >infra-chromatic> upper bounds without an explicit MaxSAT encoding. The reported results show some of the best times for a stand-alone computer over a number of instances from standard benchmarks. | URI: | http://hdl.handle.net/10261/129712 | DOI: | 10.1016/j.cor.2015.06.009 | Identificadores: | doi: 10.1016/j.cor.2015.06.009 issn: 0305-0548 |
Aparece en las colecciones: | (CAR) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
accesoRestringido.pdf | 15,38 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
35
checked on 14-mar-2024
WEB OF SCIENCETM
Citations
31
checked on 29-feb-2024
Page view(s)
217
checked on 19-mar-2024
Download(s)
96
checked on 19-mar-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.