Author:
Fotakis Dimitris,Kaporis Alexis C.,Lianeas Thanasis,Spirakis Paul G.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference39 articles.
1. Althöfer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra Appl. 99, 339–355 (1994)
2. Bollobás, B.: Random Graphs, 2nd Edition Cambridge Studies in Advanced Mathematics, vol. 3. Cambridge University Press, Cambridge (2001)
3. Braess, D.: Über ein paradox aus der Verkehrsplanung. Unternehmensforschung 12, 258–268 (1968)
4. Cheeseman, P., Kanefsky, B., Taylor, W.: Where the really hard problems are. IJCAI 1, 331–337 (1991)
5. Chung, F., Young, S.J.: Braess’s paradox in large sparse graphs. In: Proceedings of the 6th Workshop on Internet and Network Economics (WINE ’10), LNCS, vol. 6484, pp. 194–208 (2010)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献