{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T15:09:28Z","timestamp":1726758568367},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_2","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T19:56:32Z","timestamp":1182542192000},"page":"16-28","source":"Crossref","is-referenced-by-count":10,"title":["Connections in Networks: Hardness of Feasibility Versus Optimality"],"prefix":"10.1007","author":[{"given":"Jon","family":"Conrad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla P.","family":"Gomes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willem-Jan","family":"van Hoeve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordan","family":"Suter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5359","key":"2_CR1","doi-asserted-by":"publisher","first-page":"2126","DOI":"10.1126\/science.279.5359.2126","volume":"279","author":"A. Ando","year":"1998","unstructured":"Ando, A., Camm, J., Polasky, S., Solow, A.: Special distributions, land values, and efficient conservation. Science\u00a0279(5359), 2126\u20132128 (1998)","journal-title":"Science"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M.W. Bern","year":"1989","unstructured":"Bern, M.W., Plassmann, P.E.: The Steiner tree problem with edge lengths 1 and 2. Information Processing Letters\u00a032(4), 171\u2013176 (1989)","journal-title":"Information Processing Letters"},{"issue":"6","key":"2_CR3","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1287\/opre.50.6.946.351","volume":"50","author":"J.D. Camm","year":"2002","unstructured":"Camm, J.D., Norman, S.K., Polasky, S., Solow, A.R.: Nature reserve site selection to maximize expected species covered. Operations Research\u00a050(6), 946\u2013955 (2002)","journal-title":"Operations Research"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics\u00a0162(1), 439\u2013486 (2005)","journal-title":"Annals of Mathematics"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/1014052.1014068","volume-title":"Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"C. Faloutsos","year":"2004","unstructured":"Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 118\u2013127. ACM Press, New York (2004)"},{"issue":"1\u20132","key":"2_CR6","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/S0004-3702(96)00030-6","volume":"88","author":"I.P. Gent","year":"1996","unstructured":"Gent, I.P., Walsh, T.: The TSP Phase Transition. Artificial Intelligence\u00a088(1\u20132), 349\u2013358 (1996)","journal-title":"Artificial Intelligence"},{"key":"2_CR7","unstructured":"ILOG, SA. CPLEX 10.1 Reference Manual (2006)"},{"key":"2_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-80291-0","volume-title":"The Steiner Tree Problem: A Tour Through Graphs, Algorithms, and Complexity","author":"H.J. Pr\u00f6mel","year":"2002","unstructured":"Pr\u00f6mel, H.J., Steger, A.: The Steiner Tree Problem: A Tour Through Graphs, Algorithms, and Complexity. Vieweg, Wiesbaden (2002)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1046\/j.1523-1739.1992.06040493.x","volume":"6","author":"D. Simberloff","year":"1997","unstructured":"Simberloff, D., Farr, J.A., Cox, J., Mehlman, D.W.: Movement corridors: Conservation bargains or poor invesments? Conservation Biology\u00a06, 493\u2013504 (1997)","journal-title":"Conservation Biology"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0004-3702(95)00054-2","volume":"81","author":"W. Zhang","year":"1996","unstructured":"Zhang, W., Korf, R.E.: A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem. Artificial Intelligence\u00a081, 223\u2013239 (1996)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72397-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T12:05:08Z","timestamp":1550405108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}