A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974)

From MaRDI portal
Revision as of 11:29, 22 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear time algorithm for computing minmax regret 1-median on a tree network
scientific article

    Statements

    A linear time algorithm for computing minmax regret 1-median on a tree network (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 January 2015
    0 references