The parameterized complexity of the unique coverage problem

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

Volumn 4835 LNCS, Issue , 2007, Pages 621-631

  Moser, Hannes ^a   Raman, Venkatesh ^b   Sikdar, Somnath ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; PARAMETER ESTIMATION; PARAMETERIZATION; POLYNOMIALS; PROBLEM SOLVING; RADIO BROADCASTING;

COMPLETE PROBLEMS; GENERALIZATION; INPUT FAMILY; MAX CUT PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 38149099943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_54     Document Type: Conference Paper

References (6)

1. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences 45, 104-126 (1992)
2. Demaine, E.D., Hajiaghayi, M.T., Feige, U., Salavatipour, M.R.: Combination can be hard: approximability of the unique coverage problem. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), SIAM, pp. 162-171 (2006)
3. Downey, R.R., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
4. Jukna, S.: Extremal combinatorics. Springer, Berlin (2001)
5. Niedermeier, R.: An Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
6. Paz, A., Moran, S.: Non deterministic polynomial optimization problems and their approximations. Theoretical Computer Science 15, 251-277 (1981)