Packing cuts in undirected graphs (Q4812395)

From MaRDI portal
Revision as of 19:27, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2093900
Language Label Description Also known as
English
Packing cuts in undirected graphs
scientific article; zbMATH DE number 2093900

    Statements

    title
    Packing cuts in undirected graphs (English)
    0 references
    author
    Alberto Caprara
    0 references
    Alessandro Panconesi
    0 references
    Romeo Rizzi
    0 references
    published in
    Networks
    0 references
    publication date
    20 August 2004
    0 references
    zbMATH Keywords
    packing
    0 references
    edge-disjoint cuts
    0 references
    independent set
    0 references
    complexity
    0 references
    approximation
    0 references
    linear programming relaxation
    0 references

    Identifiers

    DOI
    10.1002/net.20008
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    90C05
    0 references
    05C70
    0 references
    68R10
    0 references
    90C35
    0 references
    zbMATH DE Number
    2093900
    0 references
    OpenAlex ID
    W2137293391
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4812395&oldid=34368743"
    Powered by MediaWiki