Finding the \(K\) shortest hyperpaths (Q1764762)

From MaRDI portal
Revision as of 08:13, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Finding the \(K\) shortest hyperpaths
scientific article

    Statements

    title
    Finding the \(K\) shortest hyperpaths (English)
    0 references
    author
    Lars Relund Nielsen
    0 references
    Kim Allan Andersen
    0 references
    Daniele Pretolani
    0 references
    publication date
    22 February 2005
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    90C35
    0 references
    05C65
    0 references
    05C20
    0 references
    zbMATH DE Number
    2136907
    0 references
    zbMATH Keywords
    Network programming
    0 references
    Directed hypergraphs
    0 references
    \(K\) shortest hyperpaths
    0 references
    \(K\) shortest paths
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1764762&oldid=14101927"
    Powered by MediaWiki