{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:13:59Z","timestamp":1787498039101,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540614227","type":"print"},{"value":"9783540685296","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_121","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:37:32Z","timestamp":1330274252000},"page":"66-75","source":"Crossref","is-referenced-by-count":71,"title":["The constrained minimum spanning tree problem"],"prefix":"10.1007","author":[{"given":"R.","family":"Ravi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. X.","family":"Goemans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0305-0548(82)90026-0","volume":"9","author":"V. Aggarwal","year":"1982","unstructured":"V. Aggarwal, Y. Aneja and K. Nair, \u201cMinimal spanning tree subject to a side constraint,\u201d Comput. Operations Res. 9, 287\u2013296 (1982).","journal-title":"Comput. Operations Res."},{"key":"7_CR2","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, McGraw Hill (1990)."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/net.3230200306","volume":"20","author":"M. Guignard","year":"1990","unstructured":"M. Guignard and M.B. Rosenwein, \u201cAn application of Lagrangean decomposition to the resource-constrained minimum weighted arborescence problem,\u201d Networks 20, 345\u2013359 (1990).","journal-title":"Networks"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"J.-H. Lin and J.S. Vitter, \u201c\u03b5-approximations with minimum packing constraint violation,\u201d Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, 771\u2013782 (1992).","DOI":"10.1145\/129712.129787"},{"key":"7_CR5","first-page":"487","volume":"944","author":"M.V. Marathe","year":"1995","unstructured":"M.V. Marathe, R. Ravi, R. Sundaram, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt III, \u201cBicriteria network design problems,\u201d Proc. of the 22nd ICALP, LNCS 944, 487\u2013498 (1995).","journal-title":"LNCS"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Meggido","year":"1983","unstructured":"N. Meggido, \u201cApplying parallel computation algorithms in the design of serial algorithms,\u201d Journal of the ACM 30, 852\u2013865 (1983).","journal-title":"Journal of the ACM"},{"key":"7_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, New York (1988)."},{"key":"7_CR8","first-page":"669","volume":"C-27","author":"F.P. Preparata","year":"1978","unstructured":"F.P. Preparata, \u201cNew parallel-sorting schemes\u201d, IEEE Trans. Corn-put. C-27, 669\u2013673 (1978).","journal-title":"IEEE Trans. Corn-put."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt III, \u201cMany birds with one stone: Multi-objective approximation algorithms,\u201d Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 438\u2013447 (1993).","DOI":"10.1145\/167088.167209"},{"key":"7_CR10","unstructured":"D.B. Shmoys and E. Tardos, \u201dScheduling unrelated parallel machines with costs,\u201d Proc., 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 448\u2013454 (1993)."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"D.D. Sleator and R.E. Tarjan, \u201cA Data Structure fo Dynamic Trees,\u201d Journal of Computer and System Sciences 26, 362\u2013391 (1983).","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_121.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T13:27:30Z","timestamp":1713619650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_121","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}