Fomin, Fedor V. and Grandoni, Fabrizio and Kratsch, Dieter (2005) Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. Bulletin of the European Association for Theoretical Computer Science, 87. pp. 47-77. ISSN 0252-9742
Full text not available from this repository.Abstract
This survey concerns techniques in design and analysis of algo- rithms that can be used to solve NP hard problems faster than ex- haustive search algorithms (but still in exponential time). We discuss several of such techniques: Measure & Conquer, Exponential Lower Bounds, Bounded Tree-width, and Memorization. We also consider some extensions of the mentioned techniques to parameterized algo- rithms.
| Item Type: | Scientific journal article, Newspaper article or Magazine article |
|---|---|
| Subjects: | Computer sciences |
| Depositing User: | Fabrizio Grandoni |
| Date Deposited: | 14 Mar 2014 15:04 |
| Last Modified: | 24 May 2016 06:09 |
| URI: | http://repository.supsi.ch/id/eprint/4525 |
Actions (login required)
 |
View Item |