{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:52:00Z","timestamp":1725605520965},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215261"},{"type":"electronic","value":"9783642215278"}],"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-21527-8_20","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:01:16Z","timestamp":1315479676000},"page":"156-161","source":"Crossref","is-referenced-by-count":3,"title":["On the Weight-Constrained Minimum Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Agostinho","family":"Agra","sequence":"first","affiliation":[]},{"given":"Adelaide","family":"Cerveira","sequence":"additional","affiliation":[]},{"given":"Cristina","family":"Requejo","sequence":"additional","affiliation":[]},{"given":"Eul\u00e1lia","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0305-0548(82)90026-0","volume":"9","author":"V. Aggarwal","year":"1982","unstructured":"Aggarwal, V., Aneja, Y.P., Nair, K.P.K.: Minimal spanning tree subject to a side constraint. Computers and Operations Research\u00a09, 287\u2013296 (1982)","journal-title":"Computers and Operations Research"},{"issue":"9","key":"20_CR2","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/0305-0548(94)00074-I","volume":"22","author":"L. Gouveia","year":"1995","unstructured":"Gouveia, L.: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. Computers and Operations Research\u00a022(9), 959\u2013970 (1995)","journal-title":"Computers and Operations Research"},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1137\/S0097539703426775","volume":"33","author":"R. Hassin","year":"2004","unstructured":"Hassin, R., Levin, A.: An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM Journal on Computing\u00a033(2), 261\u2013268 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.orl.2003.06.003","volume":"32","author":"S.P. Hong","year":"2004","unstructured":"Hong, S.P., Chung, S.J., Park, B.H.: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Operations Research Letters\u00a032, 233\u2013239 (2004)","journal-title":"Operations Research Letters"},{"issue":"1\u20132","key":"20_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","volume":"124","author":"K. Kaparis","year":"2010","unstructured":"Kaparis, K., Letchford, A.: Separation algorithms for 0-1 knapsack polytopes. Mathematical Programming\u00a0124(1\u20132), 69\u201391 (2010)","journal-title":"Mathematical Programming"},{"key":"20_CR6","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/S0927-0507(05)80126-4","volume-title":"Network Models","author":"T. Magnanti","year":"1995","unstructured":"Magnanti, T., Wolsey, L.: Optimal trees. In: Ball, M., Magnanti, T., Monma, C., Nemhauser, G. (eds.) Network Models. Handbooks in Operations Research and Management Science, vol.\u00a07, pp. 503\u2013615. Elsevier Science Publishers, North-Holland, Amsterdam (1995)"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C. Miller","year":"1960","unstructured":"Miller, C., Tucker, A., Zemlin, R.: Integer programming formulations and travelling salesman problems. Journal of the Association for Computing Machinery\u00a07, 326\u2013329 (1960)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Pisinger, D.: Where are the hard knapsack problems? Technical Report 2003\/08, DIKU, University of Copenhagen, Denmark (2003)","DOI":"10.1016\/S0305-0548(04)00036-X"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-61422-2_121","volume-title":"Algorithm Theory - SWAT \u201996","author":"R. Ravi","year":"1996","unstructured":"Ravi, R., Goemans, M.: The constrained minimum spanning tree problem. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol.\u00a01097, pp. 66\u201375. Springer, Heidelberg (1996)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/net.3230130203","volume":"13","author":"A. Shogan","year":"1983","unstructured":"Shogan, A.: Constructing a minimal-cost spanning tree subject to resource constraints and flow requirements. Networks\u00a013, 169\u2013190 (1983)","journal-title":"Networks"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/00207160412331290667","volume":"82","author":"T. Yamada","year":"2005","unstructured":"Yamada, T., Watanabe, K., Kataoka, S.: Algorithms to solve the knapsack constrained maximum spanning tree problem. International Journal of Computer Mathematics\u00a082, 23\u201334 (2005)","journal-title":"International Journal of Computer Mathematics"}],"container-title":["Lecture Notes in Computer Science","Network Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21527-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T04:27:28Z","timestamp":1560572848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}