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...
| Publicado en: | Communications of the ACM Vol. 56; no. 3; pp. 80 - 89 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Mar2013
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=89062158&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 89062158 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Mar2013 vid: 56 iid: 3 pid: 68 pub: Association for Computing Machinery artinfo: ui: 89062158 10.1145/2428556.2428575 ppf: 80 ppct: 9 formats: tig: atl: Exact Exponential Algorithms. aug: au: FOMIN, FEDOR V. KASKI, PETTERI affil: Professor, Institutt for Informatikk, University of Bergen, Norway Academic Research Fellow, Dept. of Information & Computer Science, Aalto University, Aalto, Finland su: Exponential functions Algorithm research Problem solving Parameter estimation Approximation algorithms Computer science research sug: subj: Exponential functions Algorithm research Problem solving Parameter estimation Approximation algorithms Computer science research ab: 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. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2013 holdings: @attributes: islocal: N |
|---|