Some Prospects for Efficient Fixed Parameter Algorithms (1998)
| Venue: | In Proc. of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM’98), Springer, LNCS 1521 |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Niedermeier98someprospects,
author = {Rolf Niedermeier},
title = {Some Prospects for Efficient Fixed Parameter Algorithms},
booktitle = {In Proc. of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM’98), Springer, LNCS 1521},
year = {1998},
pages = {168--185}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Recent time has seen quite some progress in the development of exponential time algorithms for NP-hard problems, where the base of the exponential term is fairly small. These developments are also tightly related to the theory of fixed parameter tractability. In this incomplete survey, we explain some basic techniques in the design of efficient fixed parameter algorithms, discuss deficiencies of parameterized complexity theory, and try to point out some future research challenges. The focus of this paper is on the design of efficient algorithms and not on a structural theory of parameterized complexity. Moreover, our emphasis will be laid on two exemplifying issues: Vertex Cover and MaxSat problems. A shorter version of this paper appears as an invited talk in the proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'98), Springer, LNCS , held in Jasna, Slovakia, November 21--27, 1998. y Supported by a Feodor Lynen fellowship of the Alex...
