{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:21:22Z","timestamp":1761895282694,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642213106"},{"type":"electronic","value":"9783642213113"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21311-3_9","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T08:47:22Z","timestamp":1304585242000},"page":"76-91","source":"Crossref","is-referenced-by-count":8,"title":["Upgrading Shortest Paths in Networks"],"prefix":"10.1007","author":[{"given":"Bistra","family":"Dilkina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katherine J.","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla P.","family":"Gomes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms\u00a02, 153\u2013177 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-72397-4_2","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J. Conrad","year":"2007","unstructured":"Conrad, J., Gomes, C.P., van Hoeve, W.-J., Sabharwal, A., Suter, J.: Connections in networks: Hardness of feasibility versus optimality. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.\u00a04510, pp. 16\u201328. Springer, Heidelberg (2007)"},{"volume-title":"Connectivity Conservation","year":"2006","key":"9_CR3","unstructured":"Crooks, K.R., Sanjayan, M. (eds.): Connectivity Conservation. Cambridge University Press, Cambridge (2006)"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1111\/j.1523-1739.2008.01111.x","volume":"23","author":"S.A. Cushman","year":"2009","unstructured":"Cushman, S.A., McKelvey, K.S., Schwartz, M.K.: Use of empirically derived source-destination models to map regional conservation corridors.. Conservation Biology\u00a023(2), 368\u2013376 (2009)","journal-title":"Conservation Biology"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-13520-0_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B. Dilkina","year":"2010","unstructured":"Dilkina, B., Gomes, C.P.: Solving connected subgraph problems in wildlife conservation. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 102\u2013116. Springer, Heidelberg (2010)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Feige, U., Mirrokni, V.S.: Maximizing non-monotone submodular functions. In: FOCS, pp. 461\u2013471 (2007)","DOI":"10.1109\/FOCS.2007.4389516"},{"key":"9_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"9_CR8","unstructured":"Gomes, C.P.: Computational Sustainability: Computational methods for a sustainable environment, economy, and society. The Bridge, National Academy of Engineering 39(4) (Winter 2009)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-68155-7_27","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C.P. Gomes","year":"2008","unstructured":"Gomes, C.P., van Hoeve, W.-J., Sabharwal, A.: Connections in networks: A hybrid approach. In: Trick, M.A. (ed.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 303\u2013307. Springer, Heidelberg (2008)"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1111\/j.1523-1739.2008.01124.x","volume":"23","author":"L.N. Joseph","year":"2009","unstructured":"Joseph, L.N., Maloney, R.F., Possingham, H.P.: Optimal allocation of resources among threatened species: a project prioritization protocol. Conservation Biology\u00a023(2), 328\u2013338 (2009)","journal-title":"Conservation Biology"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1006\/jagm.1999.1021","volume":"33","author":"S. Krumke","year":"1999","unstructured":"Krumke, S.: Improving Minimum Cost Spanning Trees by Upgrading Nodes. Journal of Algorithms\u00a033(1), 92\u2013111 (1999)","journal-title":"Journal of Algorithms"},{"key":"9_CR12","unstructured":"Lin, H., Bilmes, J.: Multi-document summarization via budgeted maximization of submodular functions. In: Human Language Technology Conference, NAACL\/HLT (2010)"},{"issue":"12","key":"9_CR13","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1016\/j.tree.2006.10.003","volume":"21","author":"R. Naidoo","year":"2006","unstructured":"Naidoo, R., Balmford, A., Ferraro, P.J., Polasky, S., Ricketts, T.H., Rouget, M.: Integrating economic costs into conservation planning. Trends in Ecology & Evolution\u00a021(12), 681\u2013687 (2006)","journal-title":"Trends in Ecology & Evolution"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G.L. Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Mathematical Programming\u00a014(1), 265\u2013294 (1978)","journal-title":"Mathematical Programming"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.3230260105","volume":"26","author":"D. Paik","year":"1995","unstructured":"Paik, D., Sahni, S.: Network upgrading problems. Networks\u00a026(1), 45\u201358 (1995)","journal-title":"Networks"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Singleton, P.H., Gaines, W.L., Lehmkuhl, J.F.: Landscape permeability for large carnivores in washington: a geographic information system weighted-distance and least-cost corridor assessment. Res. Pap. PNW-RP-549: U.S. Dept. of Agric., Forest Service, Pacific Northwest Research Station (2002)","DOI":"10.2737\/PNW-RP-549"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2307\/3545723","volume":"73","author":"P.D. Taylor","year":"1993","unstructured":"Taylor, P.D., Fahrig, L., Henein, K., Merriam, G.: Connectivity is a vital element of landscape structure. Oikos\u00a073, 43\u201348 (1993)","journal-title":"Oikos"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21311-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:05:25Z","timestamp":1609203925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21311-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642213106","9783642213113"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21311-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}