Imagen de Portada
Código QR

Exact Exponential Algorithms.

The article discusses exact exponential algorithms, focusing on the results of research concerning Maximum 2-Satisfiability, Graph Coloring, and Hamiltonian Path problems as of March 2013. It emphasizes potential surprises in research related to computing and presents unsolved problems relating to t...

Descripción completa

Publicado en:Communications of the ACM Vol. 56; no. 3; pp. 80 - 89
Autores principales: FOMIN, FEDOR V., KASKI, PETTERI
Formato: Artículo
Publicado: Association for Computing Machinery Mar2013
Materias:
Exponential functions
Algorithm research
Problem solving
Parameter estimation
Approximation algorithms
Computer science research
Acceso en línea:Ver este registro en EBSCOhost
Sumario:The article discusses exact exponential algorithms, focusing on the results of research concerning Maximum 2-Satisfiability, Graph Coloring, and Hamiltonian Path problems as of March 2013. It emphasizes potential surprises in research related to computing and presents unsolved problems relating to topics such as edge coloring. Topics include the use of parameterized algorithms and approximation algorithms in circumstances involving intractability, the improvement of exhaustive search, and dynamic computing.