Author:
Cardinal Jean,Demaine Erik D.,Fiorini Samuel,Joret Gwenaël,Langerman Stefan,Newman Ilan,Weimann Oren
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1-2), 123–134 (2000)
2. Altman, E., Boulogne, T., El-Azouzi, R., Jiménez, T., Wynter, L.: A survey on networking games in telecommunications. Computers and Operations Research 33(2), 286–311 (2006)
3. Cardinal, J., Labbé, M., Langerman, S., Palop, B.: Pricing of geometric transportation networks. In: CCCG. Proc. Canadian Conference on Computational Geometry, pp. 92–96 (2005)
4. Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: STOC. Proc. Symp. Theory of Computing, pp. 521–530 (2003)
5. Lecture Notes in Computer Science;K. Dhamdhere,2005
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献