Back to Search Start Over

Exact Exponential Algorithms.

Authors :
FOMIN, FEDOR V.
KASKI, PETTERI
Source :
Communications of the ACM; Mar2013, Vol. 56 Issue 3, p80-88, 9p, 1 Color Photograph, 7 Diagrams
Publication Year :
2013

Abstract

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.

Details

Language :
English
ISSN :
00010782
Volume :
56
Issue :
3
Database :
Complementary Index
Journal :
Communications of the ACM
Publication Type :
Periodical
Accession number :
89062158
Full Text :
https://doi.org/10.1145/2428556.2428575