Simple on-line algorithms for the maximum disjoint paths problem (Q1889861)

From MaRDI portal
Revision as of 23:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Simple on-line algorithms for the maximum disjoint paths problem
scientific article

    Statements

    title
    Simple on-line algorithms for the maximum disjoint paths problem (English)
    0 references
    author
    Petr Kolman
    0 references
    Christian Scheideler
    0 references
    published in
    Algorithmica
    0 references
    publication date
    13 December 2004
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C35
    0 references
    90C59
    0 references
    68Q10
    0 references
    05C38
    0 references
    05C85
    0 references
    68R10
    0 references
    zbMATH DE Number
    2121787
    0 references
    OpenAlex ID
    W1994611404
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1889861&oldid=32303280"
    Powered by MediaWiki