Efficient Methods for Selfish Network Design
From MaRDI portal
Publication:5321677
DOI10.1007/978-3-642-02930-1_38zbMath1248.68061OpenAlexW1599469676WikidataQ59818477 ScholiaQ59818477MaRDI QIDQ5321677
Alexis C. Kaporis, Dimitris Fotakis, Paul G. Spirakis
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_38
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Related Items (3)
On the hardness of network design for bottleneck routing games ⋮ Selfish splittable flows and NP-completeness ⋮ Braess's paradox in expanders
This page was built for publication: Efficient Methods for Selfish Network Design
