{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:52:20Z","timestamp":1725605540400},"publisher-location":"Berlin, Heidelberg","reference-count":5,"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_10","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:01:16Z","timestamp":1315479676000},"page":"77-82","source":"Crossref","is-referenced-by-count":1,"title":["Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Gouveia","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Moura","sequence":"additional","affiliation":[]},{"given":"Amaro","family":"de Sousa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.20166","volume":"50","author":"A. Cunha","year":"2007","unstructured":"Cunha, A., Lucena, A.: Lower and upper bounds for the Degree-constrained Minimum Spanning Tree Problem. Networks\u00a050(1), 55\u201366 (2007)","journal-title":"Networks"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Duhamel, C., Gouveia, L., Moura, P., Souza, M.: Models and Heuristics for the k-degree constrained minimum spanning tree problem with node-degree costs. To appear in Networks (2011)","DOI":"10.1002\/net.20445"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.endm.2010.05.125","volume":"36","author":"L. Gouveia","year":"2010","unstructured":"Gouveia, L., Moura, P.: Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. Electronic Notes in Discrete Mathematics\u00a036, 985\u2013992 (2010)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.cor.2010.04.016","volume":"38","author":"L. Gouveia","year":"2010","unstructured":"Gouveia, L., Moura, P., Sousa, A.: Prize collecting Steiner trees with node degree dependent costs. Computers & Operations Research\u00a038(1), 234\u2013245 (2010)","journal-title":"Computers & Operations Research"},{"key":"10_CR5","unstructured":"Magnanti, T., Wolsey, L.: Optimal Trees. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Handbooks in Operational Research and Management Science (1995)"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T04:27:54Z","timestamp":1560572874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}