{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:34:13Z","timestamp":1757309653427},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,21]],"date-time":"2014-09-21T00:00:00Z","timestamp":1411257600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10707-014-0219-1","type":"journal-article","created":{"date-parts":[[2014,9,20]],"date-time":"2014-09-20T01:37:25Z","timestamp":1411177045000},"page":"365-404","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Best upgrade plans for single and multiple source-destination pairs"],"prefix":"10.1007","volume":"19","author":[{"given":"Yimin","family":"Lin","sequence":"first","affiliation":[]},{"given":"Kyriakos","family":"Mouratidis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,21]]},"reference":[{"issue":"1","key":"219_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"SA Alumur","year":"2008","unstructured":"Alumur SA, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190(1):1\u201321","journal-title":"Eur J Oper Res"},{"key":"219_CR2","doi-asserted-by":"crossref","unstructured":"Amaldi E, Capone A, Cesana M, Malucelli F (2007) Optimization models for the radio planning of wireless mesh networks. In: Networking, pp 287\u2013298","DOI":"10.1007\/978-3-540-72606-7_25"},{"key":"219_CR3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"JE Beasley","year":"1989","unstructured":"Beasley JE, Christofides N (1989) An algorithm for the resource constrained shortest path problem. Networks 19:379\u2013394","journal-title":"Networks"},{"key":"219_CR4","unstructured":"Ben-Moshe B, Omri E, Elkin M (2011) Optimizing budget allocation in graphs. In: CCCG"},{"issue":"1","key":"219_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","volume":"25","author":"R Boorstyn","year":"1977","unstructured":"Boorstyn R, Frank H (1977) Large-scale network topological optimization. IEEE Trans Commun 25(1):29\u201347","journal-title":"IEEE Trans Commun"},{"issue":"2","key":"219_CR6","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1002\/net.20097","volume":"47","author":"AM Campbell","year":"2006","unstructured":"Campbell AM, Lowe TJ, Zhang L (2006) Upgrading arcs to minimize the maximum travel time in a network. Networks 47(2):72\u201380","journal-title":"Networks"},{"issue":"3","key":"219_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1109\/TNSM.2009.031102","volume":"5","author":"A Capone","year":"2008","unstructured":"Capone A, Elias J, Martignon F (2008) Models and algorithms for the design of service overlay networks. IEEE Trans Netw Serv Manag 5(3):143\u2013156","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"219_CR8","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company"},{"key":"219_CR9","doi-asserted-by":"crossref","unstructured":"Deng K, Zhou X, Shen HT (2007) Multi-source skyline query processing in road networks. In: ICDE, pp 796\u2013805","DOI":"10.1109\/ICDE.2007.367925"},{"key":"219_CR10","doi-asserted-by":"crossref","unstructured":"Ding B, Yu JX, Qin L (2008) Finding time-dependent shortest paths over large graphs. In: EDBT, pp 205\u2013216","DOI":"10.1145\/1353343.1353371"},{"key":"219_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I Dumitrescu","year":"2003","unstructured":"Dumitrescu I, Boland N (2003) Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42:135\u2013153","journal-title":"Networks"},{"key":"219_CR12","doi-asserted-by":"crossref","unstructured":"Fan J, Ammar MH (2006) Dynamic topology configuration in service overlay networks: a study of reconfiguration policies. In: INFOCOM","DOI":"10.1109\/INFOCOM.2006.139"},{"key":"219_CR13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"GY Handler","year":"1980","unstructured":"Handler GY, Zang I (1980) A dual algorithm for the constrained shortest path problem. Networks 10:293\u2013309","journal-title":"Networks"},{"issue":"1","key":"219_CR14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin R (1992) Approximation schemes for the restricted shortest path problem. Math Oper Res 17(1):36\u201342","journal-title":"Math Oper Res"},{"issue":"11","key":"219_CR15","first-page":"98","volume":"39","author":"A Hills","year":"2001","unstructured":"Hills A (2001) Mentor: an algorithm for mesh network topological optimization and routing. IEEE Trans Commun 39(11):98\u2013107","journal-title":"IEEE Trans Commun"},{"issue":"8","key":"219_CR16","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1016\/j.automatica.2010.05.013","volume":"46","author":"R Jain","year":"2010","unstructured":"Jain R, Walrand J (2010) An efficient nash-implementation mechanism for network resource allocation. Automatica 46(8):1276\u20131283","journal-title":"Automatica"},{"key":"219_CR17","doi-asserted-by":"crossref","unstructured":"Jensen CS, Kol\u00e1rvr J, Pedersen TB, Timko I (2003) Nearest neighbor queries in road networks. In: GIS, pp 1\u20138","DOI":"10.1145\/956676.956677"},{"issue":"3","key":"219_CR18","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/moor.1040.0091","volume":"29","author":"R Johari","year":"2004","unstructured":"Johari R, Tsitsiklis JN (2004) Efficiency loss in a network resource allocation game. Math Oper Res 29(3):407\u2013435","journal-title":"Math Oper Res"},{"key":"219_CR19","doi-asserted-by":"crossref","unstructured":"Jung S, Pramanik S (2002) An efficient path computation model for hierarchically structured topographical road maps, vol 14","DOI":"10.1109\/TKDE.2002.1033772"},{"issue":"4","key":"219_CR20","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/26.81738","volume":"39","author":"A Kershenbaum","year":"1991","unstructured":"Kershenbaum A, Kermani P, Grover GA (1991) Mentor: an algorithm for mesh network topological optimization and routing. IEEE Trans Commun 39(4):503\u2013513","journal-title":"IEEE Trans Commun"},{"key":"219_CR21","doi-asserted-by":"crossref","unstructured":"Kriegel HP, Kr\u00f6ger P, Renz M, Schmidt T (2008) Hierarchical graph embedding for efficient query processing in very large traffic networks. In: SSDBM, pp 150\u2013167","DOI":"10.1007\/978-3-540-69497-7_12"},{"issue":"1","key":"219_CR22","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.comnet.2006.04.011","volume":"51","author":"Z Li","year":"2007","unstructured":"Li Z, Mohapatra P (2007) On investigating overlay service topologies. Comput Netw 51(1):54\u201368","journal-title":"Comput Netw"},{"key":"219_CR23","doi-asserted-by":"crossref","unstructured":"Lin Y, Mouratidis K (2013) Best upgrade plans for large road networks. In: SSTD, pp 223\u2013240","DOI":"10.1007\/978-3-642-40235-7_13"},{"issue":"5","key":"219_CR24","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz DH, Raz D (2001) A simple efficient approximation scheme for the restricted shortest path problem. Oper Res Lett 28(5):213\u2013219","journal-title":"Oper Res Lett"},{"key":"219_CR25","doi-asserted-by":"crossref","unstructured":"Maill\u00e9 P, Tuffin B (2004) Multi-bid auctions for bandwidth allocation in communication networks. In: INFOCOM","DOI":"10.1109\/INFCOM.2004.1354481"},{"key":"219_CR26","doi-asserted-by":"crossref","unstructured":"Mehlhorn K, Ziegelmann M (2000) Resource constrained shortest paths. In: Algorithms - ESA 2000, vol 1879, pp 326\u2013337","DOI":"10.1007\/3-540-45253-2_30"},{"key":"219_CR27","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M Minoux","year":"1989","unstructured":"Minoux M (1989) Networks synthesis and optimum network design problems: Models, solution methods and applications. Networks 19:313\u2013360","journal-title":"Networks"},{"issue":"10","key":"219_CR28","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1061\/(ASCE)0733-947X(2009)135:10(783)","volume":"135","author":"KP Nepal","year":"2009","unstructured":"Nepal KP, Park D, Choi CH (2009) Upgrading arc median shortest path problem for an urban transportation network. J Transp Eng 135(10):783\u2013790","journal-title":"J Transp Eng"},{"key":"219_CR29","doi-asserted-by":"crossref","unstructured":"Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: VLDB, pp 802\u2013813","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"219_CR30","doi-asserted-by":"crossref","unstructured":"de Queir\u00f3s Vieira Martins E, Pascoal MMB (2003) A new implementation of yen\u2019s ranking loopless paths algorithm. 4OR 1 (2)","DOI":"10.1007\/s10288-002-0010-2"},{"key":"219_CR31","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Handley M, Karp RM, Shenker S (2002) Topologically-aware overlay construction and server selection. In: INFOCOM","DOI":"10.1109\/INFCOM.2002.1019369"},{"issue":"2","key":"219_CR32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0166-218X(85)90007-1","volume":"10","author":"CC Ribeiro","year":"1985","unstructured":"Ribeiro CC, Minoux M (1985) A heuristic approach to hard constrained shortest path problems. Discret Appl Math 10(2):125\u2013137","journal-title":"Discret Appl Math"},{"key":"219_CR33","doi-asserted-by":"crossref","unstructured":"Roy S, Pucha H, Zhang Z, Hu YC, Qiu L (2007) Overlay node placement: Analysis, algorithms and impact on applications. In: ICDCS, p 53","DOI":"10.1109\/ICDCS.2007.127"},{"issue":"3","key":"219_CR34","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1025153016110","volume":"7","author":"C Shahabi","year":"2003","unstructured":"Shahabi C, Kolahdouzan MR, Sharifzadeh M (2003) A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica 7(3):255\u2013273","journal-title":"GeoInformatica"},{"issue":"1","key":"219_CR35","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.datak.2007.06.021","volume":"64","author":"D Stojanovic","year":"2008","unstructured":"Stojanovic D, Papadopoulos AN, Predic B, Djordjevic-Kajan S, Nanopoulos A (2008) Continuous range monitoring of mobile objects in road networks. Data Knowl Eng 64(1):77\u2013100","journal-title":"Data Knowl Eng"},{"key":"219_CR36","doi-asserted-by":"crossref","unstructured":"Zhang L (2005) Upgrading arc problem with budget constraint. In: 43rd annual Southeast regional conference - vol 1, pp 150\u2013152","DOI":"10.1145\/1167350.1167396"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-014-0219-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-014-0219-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-014-0219-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T06:04:18Z","timestamp":1565849058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-014-0219-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,21]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["219"],"URL":"https:\/\/doi.org\/10.1007\/s10707-014-0219-1","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,21]]}}}