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

  1. Vangelis Th. Paschos
  1. Federico Della Croce,
  2. Bruno Escoffier,
  3. Marcin Kamiński and
  4. Vangelis Th. Paschos

Published Online: 3 FEB 2010

DOI: 10.1002/9780470611098.ch8

Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

How to Cite

Della Croce, F., Escoffier, B., Kamiński, M. and Paschos, V. Th. (2008) Worst-case Complexity of Exact Algorithms for NP-hard Problems, in Combinatorial Optimization and Theoretical Computer Science (ed V. Th. Paschos), ISTE, London, UK. doi: 10.1002/9780470611098.ch8

Publication History

  1. Published Online: 3 FEB 2010
  2. Published Print: 1 JAN 2008

ISBN Information

Print ISBN: 9781848210219

Online ISBN: 9780470611098

SEARCH

Keywords:

  • super-polynomial time;
  • refined algorithms;
  • growing interest;
  • theoretical interest;
  • exponential procedures

Summary

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