Capacitated domination: problem complexity and approximation algorithms (Q2345937)

From MaRDI portal
Revision as of 07:48, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Capacitated domination: problem complexity and approximation algorithms
scientific article

    Statements

    title
    Capacitated domination: problem complexity and approximation algorithms (English)
    0 references
    author
    Mong-Jen Kao
    0 references
    Han Lin Chen
    0 references
    Der-Tsai Lee
    0 references
    published in
    Algorithmica
    0 references
    publication date
    21 May 2015
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    05C69
    0 references
    05C85
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6438348
    0 references
    zbMATH Keywords
    capacitated domination
    0 references
    approximation algorithms
    0 references
    dominating set
    0 references
    graph theory
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2345937&oldid=26891787"
    Powered by MediaWiki