Approximate graph coloring by semidefinite programming (Q3841651)

From MaRDI portal
Revision as of 01:05, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximate graph coloring by semidefinite programming
scientific article

    Statements

    title
    Approximate graph coloring by semidefinite programming (English)
    0 references
    DOI
    10.1145/274787.274791
    0 references
    author
    Madhu Sudan
    0 references
    David R. Karger
    0 references
    Rajeev Motwani
    0 references
    publication date
    11 January 1999
    0 references
    zbMATH DE Number
    1193051
    0 references
    zbMATH Keywords
    semidefinite optimization problems
    0 references
    OpenAlex ID
    W2069816168
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3841651&oldid=32516051"
    Powered by MediaWiki