{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:58:41Z","timestamp":1725893921368},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540778905"},{"type":"electronic","value":"9783540778912"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77891-2_16","type":"book-chapter","created":{"date-parts":[[2008,1,12]],"date-time":"2008-01-12T08:19:36Z","timestamp":1200125976000},"page":"169-179","source":"Crossref","is-referenced-by-count":1,"title":["Multi-commodity Source Location Problems and Price of Greed"],"prefix":"10.1007","author":[{"given":"Hiro","family":"Ito","sequence":"first","affiliation":[]},{"given":"Mike","family":"Paterson","sequence":"additional","affiliation":[]},{"given":"Kenya","family":"Sugihara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_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: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/jagm.2001.1203","volume":"42","author":"K. Arata","year":"2002","unstructured":"Arata, K., Iwata, S., Makino, K., Fujishige, S.: Locating sources to meet flow demands in undirected networks. J. of Algorithms\u00a042, 54\u201368 (2002)","journal-title":"J. of Algorithms"},{"key":"16_CR3","unstructured":"B\u00e1r\u00e1sz, M., Becker, J., Frank, A.: An algorithm for source location in directed graphs. EGRES Technical Report, 2004-06 (2004)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1142\/S0219265900000056","volume":"1","author":"A.M. Farley","year":"2000","unstructured":"Farley, A.M., Fragopoulou, P., Krumme, D., Proskurowski, A., Richards, D.: Multi-source spanning tree problems. J. Interconnection Networks\u00a01, 61\u201371 (2000)","journal-title":"J. Interconnection Networks"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Hayrapetyan, A., Tardos, \u00c9., Wexler, T.: The effect of collusion in congestion games. In: Proc. of the 38th annual ACM symposium on Theory of computing, pp. 89\u201398 (2006)","DOI":"10.1145\/1132516.1132529"},{"key":"16_CR6","unstructured":"Heuvel, J.V.D., Johnson, M.: Transversals of subtree hypergraphs and the source location problem in digraphs, CDAM Research Report, LSE-CDAM-2004-10 (2004)"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1002\/net.10034","volume":"40","author":"H. Ito","year":"2002","unstructured":"Ito, H., Ito, M., Itatsu, Y., Nakai, K., Uehara, H., Yokoyama, M.: Source location problems considering vertex-connectivity and edge-connectivity simultaneously. Networks\u00a040(2), 63\u201370 (2002)","journal-title":"Networks"},{"key":"16_CR8","first-page":"704","volume":"E83-A","author":"H. Ito","year":"2000","unstructured":"Ito, H., Uehara, H., Yokoyama, M.: A faster and flexible algorithm for a location problem on undirected flow networks. IEICE Trans. Fundamentals\u00a0E83-A, 704\u2013712 (2000)","journal-title":"IEICE Trans. Fundamentals"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Lee, W.C.: Spanning tree method for link state aggregation in large communication networks. In: Proc. of the 14th Annual Joint Conference of the IEEE Computer and Communication Societies, vol.\u00a01, pp. 297\u2013302 (1995)","DOI":"10.1109\/INFCOM.1995.515888"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0020-0190(01)00183-1","volume":"80","author":"H. Nagamochi","year":"2001","unstructured":"Nagamochi, H., Ishii, T., Ito, H.: Minimum cost source location problem with vertex-connectivity requirements in digraphs. Information Processing Letters\u00a080, 287\u2013294 (2001)","journal-title":"Information Processing Letters"},{"key":"16_CR11","volume-title":"Selfish routing and the price of anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish routing and the price of anarchy. MIT Press, Cambridge (2005)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1093\/ietfec\/e89-a.5.1370","volume":"E89-A","author":"K. Sugihara","year":"2006","unstructured":"Sugihara, K., Ito, H.: Maximum-cover source-location problems. IEICE Trans. Fundamentals\u00a0E89-A, 1370\u20131377 (2006)","journal-title":"IEICE Trans. Fundamentals"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Sugihara, K., Ito, H.: Maximum-cover source-location problem with objective edge-connectivity three. In: Proc. of CTW 2006, University of Duisburg-Essen, Germany, pp. 131\u2013136 (2006), Electronic Notes in Discrete Mathematics\u00a025, 165\u2013171 (2006)","DOI":"10.1016\/j.endm.2006.06.073"},{"key":"16_CR14","unstructured":"Sugihara, K., Ito, H.: Maximum-cover source-location problem with objective edge-connectivity three (journal version submitted)"},{"key":"16_CR15","first-page":"1989","volume":"E73","author":"H. Tamura","year":"1990","unstructured":"Tamura, H., Sengoku, M., Shinoda, S., Abe, T.: Location problems on undirected flow networks. IEICE Trans.\u00a0E73, 1989\u20131993 (1990)","journal-title":"IEICE Trans."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77891-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:55:05Z","timestamp":1619520905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77891-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540778905","9783540778912"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77891-2_16","relation":{},"subject":[]}}