The budgeted unique coverage problem and color-coding (Extended abstract)

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

Volumn 5675 LNCS, Issue , 2009, Pages 310-321

  Misra, Neeldhara ^a   Raman, Venkatesh ^a   Saurabh, Saket ^b   Sikdar, Somnath ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

CODING METHODS; CODING THEORY; COVERAGE PROBLEM; EXTENDED ABSTRACTS; IDENTIFYING CODE; MAX CUT; NON-TRIVIAL; OPEN PROBLEMS; PERFECT HASH FAMILY; SET COVER; TRACTABLE ALGORITHMS;

COLOR; COMPUTER PROGRAMMING; INFORMATION THEORY;

COMPUTATION THEORY;

EID: 70350325146     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03351-3_29     Document Type: Conference Paper

References (15)

1. Alon, N., Cohen, G., Krivelevich, M., Litsyn, S.: Generalized hashing and parent-identifying codes. Journal of Combinatorial Theory Series A 104(1), 207-215 (2003)
2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844-856 (1995)
3. Barg, A., Cohen, G., Encheva, S., Kabatiansky, G., Zémor, G.: A hypergraph approach to the identifying parent property: The case of multiple parents. SIAM Journal of Discrete Mathematics 14(3), 423-431 (2001)
4. Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: SODA, pp. 298-307 (2007)
5. Demaine, E.D., Hajiaghayi, M.T., Feige, U., Salavatipour, M.R.: Combination can be hard: approximability of the unique coverage problem. In: SODA, pp. 162-171 (2006)
6. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)
7. Erlebach, T., van Leeuwen, E.J.: Approximating geometric coverage problems. In: SODA, pp. 1267-1276 (2008)
8. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)
9. Guruswami, V., Trevisan, L.: The complexity of making unique choices: Approximating 1-in-κ sat. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 99-110. Springer, Heidelberg (2005)
10. Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39-45 (1999)
11. Mehlhorn, K.: On the program size of perfect and universal hash functions. In: Proceedings of the 23th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 170-175. IEEE, Los Alamitos (1982)
12. Moser, H., Misra, N., Raman, V., Saurabh, S., Sikdar, S.: The parameterized complexity of the Unique Coverage problem (2009) (manuscript)
13. Moser, H., Raman, V., Sikdar, S.: The parameterized complexity of the unique coverage problem. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 621-631. Springer, Heidelberg (2007)
14. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)
15. Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious κ-probe hash functions. SIAM J. Computing 19(5), 775-786 (1990)