The Budgeted Unique Coverage Problem and Color-Coding
From MaRDI portal
Publication:3392967
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
Cites work
- scientific article; zbMATH DE number 5764844 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A hypergraph approach to the identifying parent property: The case of multiple parents
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Color-coding
- Combination can be hard
- Generalized hashing and parent-identifying codes.
- Improved algorithms for path, matching, and packing problems
- The Parameterized Complexity of the Unique Coverage Problem
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- The budgeted maximum coverage problem
- The parameterized complexity of unique coverage and its variants
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)