{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:35:58Z","timestamp":1759667758484,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_25","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"259-270","source":"Crossref","is-referenced-by-count":5,"title":["On Degree Constrained Shortest Paths"],"prefix":"10.1007","author":[{"given":"Samir","family":"Khuller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwangil","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Shayman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Cook, W., Rohe, A.: Computing Minimum Weight Perfect Matchings. INFORMS Journal of Computing (1998)","DOI":"10.1287\/ijoc.11.2.138"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1006\/jagm.1997.0862","volume":"24","author":"S. Fekete","year":"1997","unstructured":"Fekete, S., Khuller, S., Klemmstein, M., Raghavachari, B., Young, N.: A Network-Flow technique for finding low-weight bounded-degree spanning trees. Journal of Algorithms\u00a024, 310\u2013324 (1997)","journal-title":"Journal of Algorithms"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/jagm.1994.1042","volume":"17","author":"M. F\u00fcrer","year":"1994","unstructured":"F\u00fcrer, M., Raghavachari, B.: Approximating the minimum degree Steiner tree to within one of optimal. Journal of Algorithms\u00a017, 409\u2013423 (1994)","journal-title":"Journal of Algorithms"},{"key":"25_CR5","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proc. of the ACM-SIAM Symp. on Discrete Algorithms, pp. 434\u2013443 (1990)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","volume":"5","author":"H.N. Gabow","year":"1984","unstructured":"Gabow, H.N., Tarjan, R.E.: Efficient algorithms for a family of matroid intersection problems. Journal of Algorithms\u00a05, 80\u2013131 (1984)","journal-title":"Journal of Algorithms"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Gurumohan, P., Hui, J.: Topology Design for Free Space Optical Network. In: ICCCN 2003 (October 2003)","DOI":"10.1109\/ICCCN.2003.1284227"},{"key":"25_CR8","unstructured":"Huang, Z., Shen, C.-C., Srisathapornphat, C., Jaikaeo, C.: Topology Control for Ad Hoc Networks with Directional Antennas. In: ICCCN 2002, Miami, Florida (October 2002)"},{"key":"25_CR9","unstructured":"Kashyap, A., Lee, K., Shayman, M.: Rollout Algorithms for Integrated Topology Control and Routing in Wireless Optical Backbone Networks. Technical Report, Institute for System Research, University of Maryland (2003)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Ravi, R.: Primal-dual algorithms come of age: approximating MST\u2019s with non-uniform degree bounds. In: Proc. of the 35th Annual Symp. on Theory of Computing, pp. 389\u2013395 (2003)","DOI":"10.1145\/780542.780600"},{"key":"25_CR11","unstructured":"Koo, S., Sahin, G., Subramaniam, S.: Dynamic LSP Provisioning in Overlay, Augmented, and Peer Architectures for IP\/MPLS over WDM Networks. In: IEEE INFOCOM (March 2004)"},{"key":"25_CR12","unstructured":"Lee, K., Shayman, M.: Optical Network Design with Optical Constraints in Multi-hop WDM Mesh Networks. In: ICCCN 2004 (October 2004)"},{"key":"25_CR13","unstructured":"Leonardi, E., Mellia, M., Marsan, M.A.: Algorithms for the Logical Topology Design in WDM All-Optical Networks. In: Optical Networks Magazine, pp. 35\u201346 (January 2000)"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Riza, N.A.: Reconfigurable Optical Wireless. In: LEOS 1999, vol.1, pp. 8\u201311 (November 1999)","DOI":"10.1109\/LEOS.1999.813481"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T20:09:40Z","timestamp":1736021380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11561071_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}