Henry Lin, Tim Roughgarden, Éva Tardos, Asher Walkover. Braess s Paradox, Fibonacci Numbers, and Exponential Inapproximability. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings. Volume 3580 of Lecture Notes in Computer Science, pages 497-512, Springer, 2005. [doi]
@inproceedings{LinRTW05,
title = {Braess s Paradox, Fibonacci Numbers, and Exponential Inapproximability},
author = {Henry Lin and Tim Roughgarden and Éva Tardos and Asher Walkover},
year = {2005},
doi = {10.1007/11523468_41},
url = {http://dx.doi.org/10.1007/11523468_41},
researchr = {https://researchr.org/publication/LinRTW05},
cites = {0},
citedby = {0},
pages = {497-512},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
editor = {Luís Caires and Giuseppe F. Italiano and Luís Monteiro and Catuscia Palamidessi and Moti Yung},
volume = {3580},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-27580-0},
}