Approximating the Minimum Chain Completion problem (Q989547)

From MaRDI portal
Revision as of 02:21, 3 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 the Minimum Chain Completion problem
scientific article

    Statements

    title
    Approximating the Minimum Chain Completion problem (English)
    0 references
    author
    Tomás Feder
    0 references
    Heikki Mannila
    0 references
    Evimaria Terzi
    0 references
    publication date
    20 August 2010
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    chain graphs
    0 references
    vertex cover
    0 references
    min cut
    0 references
    Max flow
    0 references

    Identifiers

    zbMATH DE Number
    5773838
    0 references
    OpenAlex ID
    W2005576669
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q989547&oldid=35183401"
    Powered by MediaWiki