Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD - MaRDI portal

COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852)

From MaRDI portal
scientific article
Language Label Description Also known as
English
COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD
scientific article

    Statements

    title
    COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (English)
    0 references
    author
    Panos Giannopoulos
    0 references
    Rolf Klein
    0 references
    Christian Knauer
    0 references
    Dániel Marx
    0 references
    Martin Kuetz
    0 references
    publication date
    28 May 2010
    0 references
    zbMATH Keywords
    dilation
    0 references
    geometric network
    0 references
    plane graph
    0 references
    tour
    0 references
    path
    0 references
    spanning ratio
    0 references
    stretch factor
    0 references
    NP-hardness
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C62
    0 references
    05C10
    0 references
    68Q17
    0 references
    zbMATH DE Number
    5713598
    0 references
    OpenAlex ID
    W2137045378
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3562852&oldid=37220949"
    Powered by MediaWiki