{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:34Z","timestamp":1759638454719},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_19","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"167-178","source":"Crossref","is-referenced-by-count":16,"title":["Geometric Network Design with Selfish Agents"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Krysta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Tardos, \u00c9., Wexler, T.: Near-optimal network design with selfish agents. In: Proceedings of the 35th Annual Symposium on Theory of Computing (STOC), pp. 511\u2013520 (2003)","DOI":"10.1145\/780542.780617"},{"issue":"5","key":"19_CR3","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"Journal of the ACM"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1111\/1468-0262.00155","volume":"68","author":"V. Bala","year":"2000","unstructured":"Bala, V., Goyal, S.: A non-cooperative model of network formation. Econometrica\u00a068, 1181\u20131229 (2000)","journal-title":"Econometrica"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-45471-3_18","volume-title":"Algorithm Theory - SWAT 2002","author":"M. Chleb\u00edk","year":"2002","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of the Steiner tree problem in graphs. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 170\u2013179. Springer, Heidelberg (2002)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish traffic allocation for server farms. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing (STOC), pp. 287\u2013296 (2002)","DOI":"10.1145\/509907.509952"},{"key":"19_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry - Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry - Algorithms and Applications. Springer, Heidelberg (1997)"},{"key":"19_CR8","unstructured":"Dutta, D., Goel, A., Heidemann, J.: Oblivious AQMand Nash equilibrium. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM (2003)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthera, A., Maneva, E., Papadimitriou, C., Shenker, S.: On a network creation game. In: Proceedings of the 22nd Annual ACMSymposium on Principles of Distributed Computing (PODC), pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E. Gilbert","year":"1968","unstructured":"Gilbert, E., Pollak, H.: Steiner Minimal Trees. SIAM Journal on Applied Mathematics\u00a016, 1\u201329 (1968)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M. Goemams","year":"1995","unstructured":"Goemams, M., Williamson, D.: A general approximation technique for constrained forest problems. SIAM Journal on Computing\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR12","unstructured":"Heller, H., Sarangi, S.: Nash networks with heterogeneous agents. Technical ReportWorking Paper Series, E-2001-1, Virginia Tech (2001)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","volume":"4","author":"Z. Melzak","year":"1961","unstructured":"Melzak, Z.: On the problem of Steiner. Canadian Mathematical Bulletin\u00a04, 143\u2013148 (1961)","journal-title":"Canadian Mathematical Bulletin"},{"key":"19_CR15","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 770\u2013779 (2000)"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"A. Schulz","year":"2004","unstructured":"Schulz, A., Stier Moses, N.: Selfish routing in capacitated networks. Mathematics of Operations Research\u00a029(4), 961\u2013976 (2004)","journal-title":"Mathematics of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:36:21Z","timestamp":1586471781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11533719_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}