{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:57:24Z","timestamp":1725479844660},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642366932"},{"type":"electronic","value":"9783642366949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36694-9_20","type":"book-chapter","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T06:08:39Z","timestamp":1362982119000},"page":"229-241","source":"Crossref","is-referenced-by-count":13,"title":["Shallow-Light Steiner Arborescences with Vertex Delays"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Held","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Rotter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.ipl.2010.08.016","volume":"110","author":"C. Bartoschek","year":"2010","unstructured":"Bartoschek, C., Held, S., Ma\u00dfberg, J., Rautenbach, D., Vygen, J.: The Repeater Tree Construction Problem. Information Processing Letters\u00a0110, 1079\u20131083 (2010)","journal-title":"Information Processing Letters"},{"issue":"6","key":"20_CR2","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1109\/43.137519","volume":"11","author":"J. Cong","year":"1992","unstructured":"Cong, J., Kahng, A.B., Robins, G., Sarrafzadeh, M., Wong, C.K.: Provably good performance-driven global routing. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems\u00a011(6), 739\u2013752 (1992)","journal-title":"IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Elkin, M., Solomon, S.: Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones. In: Proc. 52nd FOCS, pp. 373\u2013382 (2011)","DOI":"10.1109\/FOCS.2011.18"},{"issue":"1-2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-009-0297-2","volume":"128","author":"L. Gouveia","year":"2011","unstructured":"Gouveia, L., Simonetti, L., Uchoa, E.: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Mathematical Programming A\u00a0128(1-2), 123\u2013148 (2011)","journal-title":"Mathematical Programming A"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Hrkic, M., Lillis, J.: Generalized Buffer Insertion. In: Alpert, C., Sapatnekar, S., Mehta, D.D. (eds.) Handbook of Algorithms for VLSI Physical Design Automation, pp. 557\u2013567. CRC Press (2007)","DOI":"10.1201\/9781420013481.ch27"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Huffman, D.A.: A Method for the Construction of Minimum-Redundancy Codes. In: Proc. of the IRE, vol.\u00a040(9), pp. 1098\u20131101 (1952)","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1137\/0130013","volume":"30","author":"F.K. Hwang","year":"1976","unstructured":"Hwang, F.K.: On steiner minimal trees with rectilinear distance. SIAM Journal of Applied Mathematics\u00a030, 104\u2013114 (1976)","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01294129","volume":"14","author":"S. Khuller","year":"1995","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Balancing Minimum Spanning Trees and Shortest-Path Trees. Algorithmica\u00a014, 305\u2013321 (1995)","journal-title":"Algorithmica"},{"key":"20_CR9","unstructured":"Kraft, S.G.: A device for quantizing grouping and coding amplitude modulated pulses. Master\u2019s thesis. MIT, Cambridge (1949)"},{"key":"20_CR10","unstructured":"Manyem, P., Stallmann, M.: Some Approximation Results in Multicasting. Working Paper, North Carolina State University (1996)"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01758762","volume":"7","author":"S. Rao","year":"1992","unstructured":"Rao, S., Sadayappan, P., Hwang, F.K., Shor, P.: The Rectilinear Steiner Arborescence Problem. Algorithmica\u00a07, 277\u2013288 (1992)","journal-title":"Algorithmica"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-20807-2_30","volume-title":"Integer Programming and Combinatoral Optimization","author":"M. Ruthmair","year":"2011","unstructured":"Ruthmair, M., Raidl, G.R.: A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol.\u00a06655, pp. 376\u2013388. Springer, Heidelberg (2011)"},{"key":"20_CR13","unstructured":"Shi, W., Su, C.: The Rectilinear Steiner Arborescence Problem is NP-Complete. In: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, pp. 780\u2013787 (2000)"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C.A. Tovey","year":"1984","unstructured":"Tovey, C.A.: A Simplified NP-Complete Satisfiability Problem. Discrete Applied Mathematics\u00a08(1), 85\u201389 (1984)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36694-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T13:50:20Z","timestamp":1557582620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36694-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366932","9783642366949"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36694-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}