Approximability and inapproximability of the minimum certificate dispersal problem (Q982648): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal Dispersal of Certificate Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilizing Certificate Dispersal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic construction of sets for <i>k</i> -restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating bounded variants of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning a virtual private network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549729 / rank
 
Normal rank

Latest revision as of 00:40, 3 July 2024

scientific article
Language Label Description Also known as
English
Approximability and inapproximability of the minimum certificate dispersal problem
scientific article

    Statements

    Approximability and inapproximability of the minimum certificate dispersal problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 July 2010
    0 references
    0 references
    minimum certificate dispersal problem
    0 references
    graph theory
    0 references
    approximation algorithms
    0 references
    combinatorial optimization
    0 references
    0 references