Approximation Algorithms and Hardness Results for Labeled Connectivity Problems (Q5756701)

From MaRDI portal
Revision as of 20:24, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5187359
Language Label Description Also known as
English
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems
scientific article; zbMATH DE number 5187359

    Statements

    title
    Approximation Algorithms and Hardness Results for Labeled Connectivity Problems (English)
    0 references
    author
    Refael Hassin
    0 references
    Jérôme Monnot
    0 references
    Danny Segev
    0 references
    publication date
    5 September 2007
    0 references

    Identifiers

    DOI
    10.1007/11821069_42
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    05C40
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5187359
    0 references
    OpenAlex ID
    W1909158042
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5756701&oldid=31529443"
    Powered by MediaWiki