{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:28:19Z","timestamp":1761895699570},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402340"},{"type":"electronic","value":"9783642402357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40235-7_13","type":"book-chapter","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T04:47:24Z","timestamp":1374036444000},"page":"223-240","source":"Crossref","is-referenced-by-count":1,"title":["Best Upgrade Plans for Large Road Networks"],"prefix":"10.1007","author":[{"given":"Yimin","family":"Lin","sequence":"first","affiliation":[]},{"given":"Kyriakos","family":"Mouratidis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1016\/j.automatica.2010.05.013","volume":"46","author":"R. Jain","year":"2010","unstructured":"Jain, R., Walrand, J.: An efficient nash-implementation mechanism for network resource allocation. Automatica\u00a046(8), 1276\u20131283 (2010)","journal-title":"Automatica"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Zhang, L.: Upgrading arc problem with budget constraint. In: 43rd Annual Southeast Regional Conference, vol.\u00a01, pp. 150\u2013152 (2005)","DOI":"10.1145\/1167350.1167396"},{"issue":"10","key":"13_CR3","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1061\/(ASCE)0733-947X(2009)135:10(783)","volume":"135","author":"K.P. Nepal","year":"2009","unstructured":"Nepal, K.P., Park, D., Choi, C.H.: Upgrading arc median shortest path problem for an urban transportation network. Journal of Transportation Engineering\u00a0135(10), 783\u2013790 (2009)","journal-title":"Journal of Transportation Engineering"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB, pp. 802\u2013813 (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1025153016110","volume":"7","author":"C. Shahabi","year":"2003","unstructured":"Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica\u00a07(3), 255\u2013273 (2003)","journal-title":"GeoInformatica"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Jensen, C.S., Kol\u00e1rvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: GIS, pp. 1\u20138 (2003)","DOI":"10.1145\/956676.956677"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Deng, K., Zhou, X., Shen, H.T.: Multi-source skyline query processing in road networks. In: ICDE, pp. 796\u2013805 (2007)","DOI":"10.1109\/ICDE.2007.367925"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.datak.2007.06.021","volume":"64","author":"D. Stojanovic","year":"2008","unstructured":"Stojanovic, D., Papadopoulos, A.N., Predic, B., Djordjevic-Kajan, S., Nanopoulos, A.: Continuous range monitoring of mobile objects in road networks. Data Knowl. Eng.\u00a064(1), 77\u2013100 (2008)","journal-title":"Data Knowl. Eng."},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-69497-7_12","volume-title":"Scientific and Statistical Database Management","author":"H.-P. Kriegel","year":"2008","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Renz, M., Schmidt, T.: Hierarchical graph embedding for efficient query processing in very large traffic networks. In: Lud\u00e4scher, B., Mamoulis, N. (eds.) SSDBM 2008. LNCS, vol.\u00a05069, pp. 150\u2013167. Springer, Heidelberg (2008)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng.\u00a014(5) (2002)","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205\u2013216 (2008)","DOI":"10.1145\/1352431.1352459"},{"issue":"11","key":"13_CR12","first-page":"98","volume":"39","author":"A. Hills","year":"2001","unstructured":"Hills, A.: Mentor: an algorithm for mesh network topological optimization and routing. IEEE Transactions on Communications\u00a039(11), 98\u2013107 (2001)","journal-title":"IEEE Transactions on Communications"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-72606-7_25","volume-title":"NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet","author":"E. Amaldi","year":"2007","unstructured":"Amaldi, E., Capone, A., Cesana, M., Malucelli, F.: Optimization models for the radio planning of wireless mesh networks. In: Akyildiz, I.F., Sivakumar, R., Ekici, E., Oliveira, J.C., de McNair, J. (eds.) NETWORKING 2007. LNCS, vol.\u00a04479, pp. 287\u2013298. Springer, Heidelberg (2007)"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","volume":"25","author":"R. Boorstyn","year":"1977","unstructured":"Boorstyn, R., Frank, H.: Large-scale network topological optimization. IEEE Transactions on Communications\u00a025(1), 29\u201347 (1977)","journal-title":"IEEE Transactions on Communications"},{"key":"13_CR15","unstructured":"Ratnasamy, S., Handley, M., Karp, R.M., Shenker, S.: Topologically-aware overlay construction and server selection. In: INFOCOM (2002)"},{"issue":"4","key":"13_CR16","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/26.81738","volume":"39","author":"A. Kershenbaum","year":"1991","unstructured":"Kershenbaum, A., Kermani, P., Grover, G.A.: Mentor: an algorithm for mesh network topological optimization and routing. IEEE Transactions on Communications\u00a039(4), 503\u2013513 (1991)","journal-title":"IEEE Transactions on Communications"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"Minoux, M.: Networks synthesis and optimum network design problems: Models, solution methods and applications. Networks\u00a019, 313\u2013360 (1989)","journal-title":"Networks"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.comnet.2006.04.011","volume":"51","author":"Z. Li","year":"2007","unstructured":"Li, Z., Mohapatra, P.: On investigating overlay service topologies. Computer Networks\u00a051(1), 54\u201368 (2007)","journal-title":"Computer Networks"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1109\/TNSM.2009.031102","volume":"5","author":"A. Capone","year":"2008","unstructured":"Capone, A., Elias, J., Martignon, F.: Models and algorithms for the design of service overlay networks. IEEE Transactions on Network and Service Management\u00a05(3), 143\u2013156 (2008)","journal-title":"IEEE Transactions on Network and Service Management"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Fan, J., Ammar, M.H.: Dynamic topology configuration in service overlay networks: A study of reconfiguration policies. In: INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.139"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Roy, S., Pucha, H., Zhang, Z., Hu, Y.C., Qiu, L.: Overlay node placement: Analysis, algorithms and impact on applications. In: ICDCS, p. 53 (2007)","DOI":"10.1109\/ICDCS.2007.127"},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S.A. Alumur","year":"2008","unstructured":"Alumur, S.A., Kara, B.Y.: Network hub location problems: The state of the art. European Journal of Operational Research\u00a0190(1), 1\u201321 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"13_CR23","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1287\/moor.1040.0091","volume":"29","author":"R. Johari","year":"2004","unstructured":"Johari, R., Tsitsiklis, J.N.: Efficiency loss in a network resource allocation game. Math. Oper. Res.\u00a029(3), 407\u2013435 (2004)","journal-title":"Math. Oper. Res."},{"key":"13_CR24","unstructured":"Maill\u00e9, P., Tuffin, B.: Multi-bid auctions for bandwidth allocation in communication networks. In: INFOCOM (2004)"},{"key":"13_CR25","unstructured":"Ben-Moshe, B., Omri, E., Elkin, M.: Optimizing budget allocation in graphs. In: CCCG (2011)"},{"issue":"2","key":"13_CR26","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1002\/net.20097","volume":"47","author":"A.M. Campbell","year":"2006","unstructured":"Campbell, A.M., Lowe, T.J., Zhang, L.: Upgrading arcs to minimize the maximum travel time in a network. Networks\u00a047(2), 72\u201380 (2006)","journal-title":"Networks"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G.Y. Handler","year":"1980","unstructured":"Handler, G.Y., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks\u00a010, 293\u2013309 (1980)","journal-title":"Networks"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J.E. Beasley","year":"1989","unstructured":"Beasley, J.E., Christofides, N.: An algorithm for the resource constrained shortest path problem. Networks\u00a019, 379\u2013394 (1989)","journal-title":"Networks"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-45253-2_30","volume-title":"Algorithms - ESA 2000","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., Ziegelmann, M.: Resource constrained shortest paths. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 326\u2013337. Springer, Heidelberg (2000)"},{"issue":"2","key":"13_CR30","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0166-218X(85)90007-1","volume":"10","author":"C.C. Ribeiro","year":"1985","unstructured":"Ribeiro, C.C., Minoux, M.: A heuristic approach to hard constrained shortest path problems. Discrete Applied Mathematics\u00a010(2), 125\u2013137 (1985)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"13_CR31","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res.\u00a017(1), 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"13_CR32","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"D.H. Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters\u00a028(5), 213\u2013219 (2001)","journal-title":"Operations Research Letters"},{"key":"13_CR33","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I. Dumitrescu","year":"2003","unstructured":"Dumitrescu, I., Boland, N.: Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks\u00a042, 135\u2013153 (2003)","journal-title":"Networks"},{"key":"13_CR34","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company (2001)"},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Martins, E.Q.V., Pascoal, M.M.B.: A new implementation of yen\u2019s ranking loopless paths algorithm. 4OR 1(2) (2003)","DOI":"10.1007\/s10288-002-0010-2"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40235-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:45:29Z","timestamp":1557960329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40235-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402340","9783642402357"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40235-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}