{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:41Z","timestamp":1725586841990},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"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-20807-2_30","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T13:58:49Z","timestamp":1308405529000},"page":"376-388","source":"Crossref","is-referenced-by-count":10,"title":["A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems"],"prefix":"10.1007","author":[{"given":"Mario","family":"Ruthmair","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/S1571-0653(04)00247-1","volume":"7","author":"M. de Arag\u00e3o","year":"2001","unstructured":"de Arag\u00e3o, M., Uchoa, E., Werneck, R.: Dual heuristics on the exact solution of large Steiner problems. Electronic Notes in Discrete Mathematics\u00a07, 150\u2013153 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks\u00a01, 195\u2013207 (1971)","journal-title":"Networks"},{"key":"30_CR3","doi-asserted-by":"crossref","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, pp. 1\u201326 (2010)","DOI":"10.1007\/s10107-009-0297-2"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/ijoc.10.2.180","volume":"10","author":"L. Gouveia","year":"1998","unstructured":"Gouveia, L.: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints. Informs Journal on Computing\u00a010(2), 180\u2013188 (1998)","journal-title":"Informs Journal on Computing"},{"key":"30_CR5","first-page":"21","volume-title":"Using hop-indexed models for constrained spanning and Steiner tree models","author":"L. Gouveia","year":"1999","unstructured":"Gouveia, L.: Using hop-indexed models for constrained spanning and Steiner tree models, pp. 21\u201332. Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.cor.2006.03.022","volume":"35","author":"L. Gouveia","year":"2008","unstructured":"Gouveia, L., Paias, A., Sharma, D.: Modeling and Solving the Rooted Distance-Constrained Minimum Spanning Tree Problem. Computers and Operations Research\u00a035(2), 600\u2013613 (2008)","journal-title":"Computers and Operations Research"},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks\u00a032(3), 207\u2013232 (1998)","journal-title":"Networks"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V.P. Kompella","year":"1993","unstructured":"Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE \/ ACM Transactions on Networking\u00a01(3), 286\u2013292 (1993)","journal-title":"IEEE \/ ACM Transactions on Networking"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.endm.2010.05.029","volume":"36","author":"V. Leggieri","year":"2010","unstructured":"Leggieri, V., Haouari, M., Triki, C.: An Exact Algorithm for the Steiner Tree Problem with Delays. Electronic Notes in Discrete Mathematics\u00a036, 223\u2013230 (2010)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"30_CR10","first-page":"207","volume-title":"Electronic Notes in Discrete Mathematics","author":"I. Ljubic","year":"2010","unstructured":"Ljubic, I., Gollowitzer, S.: Modelling the hop constrained connected facility location problem on layered graphs. In: Electronic Notes in Discrete Mathematics, vol.\u00a036, pp. 207\u2013214. Elsevier, Amsterdam (2010)"},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubic","year":"2006","unstructured":"Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming\u00a0105(2), 427\u2013449 (2006)","journal-title":"Mathematical Programming"},{"key":"30_CR12","unstructured":"Manyem, P., Stallmann, M.: Some approximation results in multicasting. Tech. Rep. TR-96-03, North Carolina State University (1996)"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01949715","volume":"18","author":"L. Nastansky","year":"1974","unstructured":"Nastansky, L., Selkow, S., Stewart, N.: Cost-minimal trees in directed acyclic graphs. Mathematical Methods of Operations Research\u00a018(1), 59\u201367 (1974)","journal-title":"Mathematical Methods of Operations Research"},{"key":"30_CR14","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: SODA 2000: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, pp. 770\u2013779. Society for Industrial and Applied Mathematics (2000)"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-642-04772-5_92","volume-title":"Computer Aided Systems Theory - EUROCAST 2009","author":"M. Ruthmair","year":"2009","unstructured":"Ruthmair, M., Raidl, G.R.: A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In: Moreno-D\u00edaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2009. LNCS, vol.\u00a05717, pp. 713\u2013720. Springer, Heidelberg (2009)"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","first-page":"391","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"M. Ruthmair","year":"2010","unstructured":"Ruthmair, M., Raidl, G.R.: Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol.\u00a06239, pp. 391\u2013400. Springer, Heidelberg (2010)"},{"key":"30_CR17","unstructured":"Xu, Y., Qu, R.: A GRASP approach for the Delay-constrained Multicast routing problem. In: Proceedings of the 4th Multidisplinary International Scheduling Conference (MISTA4), Dublin, Ireland, pp. 93\u2013104 (2009)"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Xu, Y., Qu, R.: A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems. Applied Intelligence, 1\u201313 (2010)","DOI":"10.1007\/s10489-010-0256-x"},{"issue":"1","key":"30_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02523690","volume":"18","author":"A. Zelikovsky","year":"1997","unstructured":"Zelikovsky, A.: A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica\u00a018(1), 99\u2013110 (1997)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T00:16:03Z","timestamp":1560298563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}