Minimum monopoly in regular and tree graphs (Q2497525): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in approximation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast approximation algorithm for the multicovering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-local distributed mending (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813266 / rank
 
Normal rank

Latest revision as of 17:33, 24 June 2024

scientific article
Language Label Description Also known as
English
Minimum monopoly in regular and tree graphs
scientific article

    Statements

    Minimum monopoly in regular and tree graphs (English)
    0 references
    0 references
    4 August 2006
    0 references
    minimum monopoly
    0 references
    APX-complete
    0 references
    algorithms
    0 references

    Identifiers