EnglishWe prove several complexity results about the gap inequalities for the max-cut problem, including (i) the gap-1 inequalities do not imply the other gap inequalities, unless NP==Co NP; (ii) there must exist non-redundant gap inequalities with exponentially large coefficients, unless NP=Co NP; (iii) the associated separation problem can be solved in finite (doubly exponential) time.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/11568/457072| Autori interni: | GALLI, LAURA |
| Autori: | Galli, Laura; Kaparis, Konstantinos; Letchford, Adam |
| Titolo: | Complexity results for the gap inequalities for the max-cut problem |
| Anno del prodotto: | 2012 |
| Abstract: | We prove several complexity results about the gap inequalities for the max-cut problem, including (i) the gap-1 inequalities do not imply the other gap inequalities, unless NP==Co NP; (ii) there must exist non-redundant gap inequalities with exponentially large coefficients, unless NP=Co NP; (iii) the associated separation problem can be solved in finite (doubly exponential) time. |
| Digital Object Identifier (DOI): | 10.1016/j.orl.2012.01.010 |
| Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
Copyright © 2017