New Races in Parameterized Algorithmics

  • Christian Komusiewicz
  • Rolf Niedermeier
Conference paper

DOI: 10.1007/978-3-642-32589-2_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7464)
Cite this paper as:
Komusiewicz C., Niedermeier R. (2012) New Races in Parameterized Algorithmics. In: Rovan B., Sassone V., Widmayer P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg

Abstract

Once having classified an NP-hard problem fixed-parameter tractable with respect to a certain parameter, the race for the most efficient fixed-parameter algorithm starts. Herein, the attention usually focuses on improving the running time factor exponential in the considered parameter, and, in case of kernelization algorithms, to improve the bound on the kernel size. Both from a practical as well as a theoretical point of view, however, there are further aspects of efficiency that deserve attention. We discuss several of these aspects and particularly focus on the search for “stronger parameterizations” in developing fixed-parameter algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Christian Komusiewicz
    • 1
  • Rolf Niedermeier
    • 1
  1. 1.Institut für Softwaretechnik und Theoretische InformatikTU BerlinGermany

Personalised recommendations