Smaller kernels for hitting set problems of constant arity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3162, Issue , 2004, Pages 121-126

  Nishimura, Naomi ^a   Ragde, Prabhakar ^a   Thilikos, Dimitrios M ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Fixed parameter algorithms; Hitting set; Kernels

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

FIXED-PARAMETER ALGORITHMS; HITTING SET PROBLEMS; HITTING SETS; KERNELS; VERTEX COVER;

PARAMETER ESTIMATION;

EID: 24144487577     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_11     Document Type: Article

References (9)

1. F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langsten, W. H. Suters, and C. T. Symons, Kernelization algorithms for the vertex cover problem: theory and experiments. Proceedings, Workshop on Algorithm Engineering and Experiments (ALENEX), 2004.
2. Jonathan F. Buss and Judy Goldsmith. Nondeterminism within P. SIAM Journal on Computing, 22(3):560-572, 1993.
3. Sam Buss, private communication, 1989.
4. J. Chen, I.A. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
5. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer, 1999.
6. Richard M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
7. G. L. Nemhauser and L. E. Trotter Jr. Vertex packings: Structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
8. Rolf Niedermeier. Invitation to fixed-parameter algorithms. PhD thesis, Universität Tübingen, 2002. Habilitation thesis.
9. Rolf Niedermeier and Peter Rossmanith. An efficient fixed parameter algorithm for 3-hitting set. Journal of Discrete Algorithms, 2(1):93-107, 2003.