{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:25:37Z","timestamp":1743103537452,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664277"},{"type":"electronic","value":"9783540483182"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48318-7_7","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T20:20:56Z","timestamp":1193343656000},"page":"60-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Minimum Congestion Spanning Trees"],"prefix":"10.1007","author":[{"given":"Renato Fonseca F.","family":"Werneck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00e3o Carlos","family":"Setubal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arlindo F.","family":"da Concei\u00e7\u00e3o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,27]]},"reference":[{"key":"7_CR1","unstructured":"R. Ahuja, T. Magnanti, and J. Orlin. Network flows. Prentice-Hall, 1993."},{"key":"7_CR2","unstructured":"T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press\/McGraw Hill, 1990."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"65B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Minimum partition of a matroid into independent subsets. J. Res. Nat. Bur. Standards, 65B:67\u201372, 1965.","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.6028\/jres.069B.005","volume":"65B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Lehman\u2019s switching game and a theorem of Nash-Williams. J. Res. Nat. Bur. Standards, 65B:73\u201377, 1965.","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"7_CR5","first-page":"445","volume":"36","author":"C. St","year":"1961","unstructured":"C. St. J. A. Nash-Williams. Edge-disjoint trees of finite graphs. J. London Math. Soc., 36:445\u2013450, 1961.","journal-title":"J. London Math. Soc."},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1287\/moor.10.4.701","volume":"10","author":"J. Roskind","year":"1985","unstructured":"J. Roskind and R. Tarjan. A note on finding minimum-cost edge-disjoint spanning trees. Mathematics of Operations Research, 10(4):701\u2013708, 1985.","journal-title":"Mathematics of Operations Research"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W. Tutte","year":"1961","unstructured":"W. Tutte. On the problem of decomposing a graph into n connected factors. J. London Math. Soc., 36:221\u2013230, 1961.","journal-title":"J. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48318-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T09:04:46Z","timestamp":1587805486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48318-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664277","9783540483182"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-48318-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}