The Budgeted Unique Coverage Problem and Color-Coding
From MaRDI portal
Publication:3392967
DOI10.1007/978-3-642-03351-3_29zbMATH Open1248.68257OpenAlexW1599787684MaRDI QIDQ3392967FDOQ3392967
Authors: Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar 
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
Recommendations
- The parameterized complexity of unique coverage and its variants
- The Parameterized Complexity of the Unique Coverage Problem
- Balanced hashing, color coding and approximate counting
- Balanced Families of Perfect Hash Functions and Their Applications
- Balanced families of perfect hash functions and their applications
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Randomized algorithms (68W20)
Cites Work
- Generalized hashing and parent-identifying codes.
- Improved algorithms for path, matching, and packing problems
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- Color-coding
- Title not available (Why is that?)
- Title not available (Why is that?)
- The budgeted maximum coverage problem
- The parameterized complexity of unique coverage and its variants
- The Parameterized Complexity of the Unique Coverage Problem
- Title not available (Why is that?)
- A hypergraph approach to the identifying parent property: The case of multiple parents
- Combination can be hard
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Cited In (6)
This page was built for publication: The Budgeted Unique Coverage Problem and Color-Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392967)
