Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing (Q3225146)

From MaRDI portal
Revision as of 22:43, 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
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
scientific article

    Statements

    Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 March 2012
    0 references
    Braess's paradox
    0 references
    selfish routing
    0 references
    price of anarchy
    0 references
    traffic networks
    0 references
    approximation algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references