Polynomial recognition of vulnerable multi-commodities

DOI10.1016/J.IPL.2022.106282MaRDI QIDQ2094357zbMATH OpenOpenAlexFDO

Authors Dario Fiorenza, Daniele Gorla, Ivano Salvo

Publication date 28 October 2022

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2022.106282

zbMATH Keywords

graph theorygraph algorithmstraffic networksbraess paradox

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
• Efficient Methods for Selfish Network Design
• Stronger bounds on Braess's paradox and the maximum latency of selfish routing
• Efficient methods for selfish network design
• Lexicographical problem of the analysis of the vulnerability of a multicommodity network

Cites work

• A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
• Excluding Braess's paradox in nonatomic selfish routing
• Inefficiencies in network models: a graph-theoretic perspective
• Network characterizations for excluding Braess's paradox
• Network topology and the efficiency of equilibrium
• On the severity of Braess's paradox: designing networks for selfish users is hard
• Über ein Paradoxon aus der Verkehrsplanung

This page was built for publication: Polynomial recognition of vulnerable multi-commodities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2094357)