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
On the computational complexity of centers locating in a graph - MaRDI portal

On the computational complexity of centers locating in a graph (Q3902477)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the computational complexity of centers locating in a graph
scientific article

    Statements

    author
    Ján Plesník
    0 references
    publication date
    1980
    0 references
    zbMATH Keywords
    p-median problem
    0 references
    NP-complete
    0 references
    communication networks
    0 references
    m-center problem
    0 references
    title
    On the computational complexity of centers locating in a graph (English)
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    94C15
    0 references
    zbMATH DE Number
    3711363
    0 references
    OpenAlex ID
    W172960762
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3902477&oldid=36900795"
    Powered by MediaWiki