The Budgeted Unique Coverage Problem and Color-Coding

DOI10.1007/978-3-642-03351-3_29zbMath1248.68257OpenAlexW1599787684MaRDI QIDQ3392967

Neeldhara Misra, Saket Saurabh, Somnath Sikdar, Venkatesh Raman

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Randomized algorithms (68W20)

Related Items (3)

The parameterized complexity of unique coverage and its variants ⋮ Confronting intractability via parameters ⋮ On nonlinear multi-covering problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized hashing and parent-identifying codes.
• The budgeted maximum coverage problem
• The parameterized complexity of unique coverage and its variants
• A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
• The Spatial Complexity of Oblivious k-Probe Hash Functions
• Combination can be hard
• Color-coding
• The Parameterized Complexity of the Unique Coverage Problem
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: The Budgeted Unique Coverage Problem and Color-Coding