The parameterized complexity of unique coverage and its variants (Q2392923): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-011-9608-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007225140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized hashing and parent-identifying codes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Code is \(W[1]\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination Can Be Hard: Approximability of the Unique Coverage Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budgeted maximum coverage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Budgeted Unique Coverage Problem and Color-Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of the Unique Coverage Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:52, 6 July 2024

scientific article
Language Label Description Also known as
English
The parameterized complexity of unique coverage and its variants
scientific article

    Statements

    The parameterized complexity of unique coverage and its variants (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 2013
    0 references
    0 references
    parameterized algorithms
    0 references
    unique coverage
    0 references
    budgeted unique coverage
    0 references
    color coding
    0 references
    hash functions
    0 references
    0 references