Computing minimum diameter color-spanning sets is hard (Q1944200)

From MaRDI portal
Revision as of 03:44, 16 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q537642)
scientific article
Language Label Description Also known as
English
Computing minimum diameter color-spanning sets is hard
scientific article

    Statements

    title
    Computing minimum diameter color-spanning sets is hard (English)
    0 references
    author
    Rudolf Fleischer
    0 references
    publication date
    4 April 2013
    0 references
    zbMATH Keywords
    analysis of algorithms
    0 references
    NP hardness
    0 references
    minimum diameter color-spanning disk
    0 references

    Identifiers

    zbMATH DE Number
    6150489
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1944200&oldid=21485164"
    Powered by MediaWiki