Approximating Edge Dominating Set in Dense Graphs (Q3010383)

From MaRDI portal
Revision as of 05:44, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximating Edge Dominating Set in Dense Graphs
scientific article

    Statements

    title
    Approximating Edge Dominating Set in Dense Graphs (English)
    0 references
    author
    Richard Schmied
    0 references
    Claus Viehmann
    0 references
    publication date
    1 July 2011
    0 references
    zbMATH Keywords
    edge dominating set
    0 references
    minimum maximal matching
    0 references
    dense instances
    0 references
    approximation algorithms
    0 references
    approximation lower bounds
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C69
    0 references
    68Q17
    0 references
    68W25
    0 references
    zbMATH DE Number
    5916945
    0 references
    OpenAlex ID
    W2133360442
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3010383&oldid=35236148"
    Powered by MediaWiki