Exact Exponential Algorithms

Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others?...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Fomin, Fedor V. (Autor), Kratsch, Dieter (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edición:1st ed. 2010.
Colección:Texts in Theoretical Computer Science. An EATCS Series,
Temas:
Discrete mathematics.
Mathematical optimization.
Computer programming.
Algorithms.
Discrete Mathematics.
Optimization.
Programming Techniques.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Branching
  • Dynamic Programming
  • Inclusion-Exclusion
  • Treewidth
  • Measure & Conquer
  • Subset Convolution
  • Local Search and SAT
  • Split and List
  • Time Versus Space
  • Miscellaneous
  • Conclusions, Open Problems and Further Directions.

Ejemplares similares