A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806)

From MaRDI portal
Revision as of 07:23, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A polylogarithmic approximation algorithm for 2-edge-connected dominating set
scientific article

    Statements

    title
    A polylogarithmic approximation algorithm for 2-edge-connected dominating set (English)
    0 references
    author
    Amir Belgi
    0 references
    Zeev Nutov
    0 references
    publication date
    19 October 2021
    0 references
    Mathematics Subject Classification ID
    05C69
    0 references
    05C40
    0 references
    68W25
    0 references
    68Q25
    0 references
    zbMATH DE Number
    7411512
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    2-edge-connected set
    0 references
    dominating set
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2234806&oldid=26810571"
    Powered by MediaWiki