An improved approximation algorithm for requirement cut (Q991474)

From MaRDI portal
Revision as of 22:25, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
An improved approximation algorithm for requirement cut
scientific article

    Statements

    title
    An improved approximation algorithm for requirement cut (English)
    0 references
    author
    Anupam Gupta
    0 references
    Viswanath Nagarajan
    0 references
    R. Ravi
    0 references
    publication date
    7 September 2010
    0 references
    zbMATH Keywords
    graph partitioning
    0 references
    approximation algorithms
    0 references
    requirement cut problem
    0 references

    Identifiers

    zbMATH DE Number
    5780112
    0 references
    OpenAlex ID
    W1992849490
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q991474&oldid=32169922"
    Powered by MediaWiki