• Citer

Worst-case Complexity of Exact Algorithms for NP-hard Problems

par Kaminski, Marcin ;Della Croce, Federico;Escoffier, B.;Paschos, V.
Editeur scientifique Paschos, V.
Référence Combinatorial Optimization and Theoretical Computer Science, ISTE Ltd and John Wiley & Sons Inc, page (203-240)
Publication Publié, 2008

Partie d'ouvrage collectif

• Détails
• Contenu

Résumé :

This chapter contains sections titled: MAX-CUT Pruning the search tree by dominance conditions: the case of MAXCUT-3 A more careful analysis for pruning: the case of MIN 3-DOMINATING SET Bibliography