A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree (Q2914306)

From MaRDI portal
Revision as of 09:24, 23 August 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
scientific article

    Statements

    A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree (English)
    0 references
    0 references
    0 references
    25 September 2012
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references