{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T23:07:38Z","timestamp":1754262458282},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_39","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"380-389","source":"Crossref","is-referenced-by-count":12,"title":["Simple Distributed Algorithms for Approximating Minimum Steiner Trees"],"prefix":"10.1007","author":[{"given":"Parinya","family":"Chalermsook","sequence":"first","affiliation":[]},{"given":"Jittat","family":"Fakcharoenphol","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for the steiner problem in graphs. Math. Jap.\u00a024, 573\u2013577 (1980)","journal-title":"Math. Jap."},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/B:MONE.0000048545.40783.fc","volume":"10","author":"C.C. Shen","year":"2005","unstructured":"Shen, C.C., Jaikaeo, C.: Ad hoc multicast routing algorithm with swarm intelligence. Mob. Netw. Appl.\u00a010, 47\u201359 (2005)","journal-title":"Mob. Netw. Appl."},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1109\/TNET.2004.828940","volume":"12","author":"P.J. Wan","year":"2004","unstructured":"Wan, P.J., C\u02d8alinescu, G., Yi, C.W.: Minimum-power multicast routing in static ad hoc wireless networks. IEEE\/ACM Trans. Netw.\u00a012, 507\u2013514 (2004)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"39_CR4","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Francisco (1996)"},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/166237.166246","volume-title":"Conference proceedings on Communications architectures, protocols and applications","author":"T. Ballardie","year":"1993","unstructured":"Ballardie, T., Francis, P., Crowcroft, J.: Core based trees (CBT). In: Conference proceedings on Communications architectures, protocols and applications, pp. 85\u201395. ACM Press, New York (1993)"},{"key":"39_CR6","first-page":"150","volume-title":"Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN 1995)","author":"L. Wei","year":"1995","unstructured":"Wei, L., Estrin, D.: Multicast routing in dense and sparse modes: simulation study of tradeoffs and dynamics. In: Proceedings of the 4th International Conference on Computer Communications and Networks (ICCCN 1995), p. 150. IEEE Computer Society, Los Alamitos (1995)"},{"key":"39_CR7","unstructured":"Pendarakis, D., Shi, S., Verma, D., Waldvogel, M.: ALMI: An application level multicast infrastructure. In: 3rd USNIX Symposium on Internet Technologies and Systems (USITS 2001), San Francisco, CA, USA, pp. 49\u201360 (2001)"},{"key":"39_CR8","unstructured":"Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: Proceedings of the eleventh annual ACM-SIAMsymposium on Discrete algorithms, Society for Industrial and Applied Mathematics, pp. 770\u2013779 (2000)"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM\u00a045, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1023\/A:1020716919751","volume":"7","author":"J.E. Wieselthier","year":"2002","unstructured":"Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-efficient broadcast and multicast trees in wireless networks. Mob. Netw. Appl.\u00a07, 481\u2013492 (2002)","journal-title":"Mob. Netw. Appl."},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1023\/A:1020381720601","volume":"8","author":"P.J. Wan","year":"2002","unstructured":"Wan, P.J., C\u02d8alinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcasting in static ad hoc wireless networks. Wirel. Netw.\u00a08, 607\u2013617 (2002)","journal-title":"Wirel. Netw."},{"key":"39_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265","volume-title":"Data structures and network algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data structures and network algorithms. Society for Industrial and Applied Mathematics, Philadelphia (1983)"},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. J. ACM\u00a032, 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"39_CR14","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/73007.73054","volume-title":"Proceedings of the twenty-first annual ACM symposium on Theory of computing","author":"B. Awerbuch","year":"1989","unstructured":"Awerbuch, B.: Randomized distributed shortest paths algorithms. In: Proceedings of the twenty-first annual ACM symposium on Theory of computing, pp. 490\u2013500. ACM Press, New York (1989)"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimumweight spanning trees. ACM Trans. Program. Lang. Syst.\u00a05, 66\u201377 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"39_CR16","first-page":"359","volume-title":"Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms","author":"M. Elkin","year":"2004","unstructured":"Elkin, M.: A faster distributed protocol for constructing a minimum spanning tree. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 359\u2013368. SIAM, Philadelphia (2004)"},{"key":"39_CR17","first-page":"230","volume-title":"Proceedings of the nineteenth annual ACM conference on Theory of computing","author":"B. Awerbuch","year":"1987","unstructured":"Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 230\u2013240. ACM Press, New York (1987)"},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/224964.224990","volume-title":"Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing","author":"S. Kutten","year":"1995","unstructured":"Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, pp. 238\u2013251. ACM Press, New York (1995)"},{"key":"39_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/323596.323612","volume-title":"Proceedings of the fourth annual ACM symposium on Principles of distributed computing","author":"E. Gafni","year":"1985","unstructured":"Gafni, E.: Improvements in the time complexity of two message-optimal election algorithms. In: Proceedings of the fourth annual ACM symposium on Principles of distributed computing, pp. 175\u2013185. ACM Press, New York (1985)"},{"key":"39_CR20","first-page":"37","volume":"3","author":"O. Boruvka","year":"1926","unstructured":"Boruvka, O.: O jist\u00e9m probl\u00e9mu minim\u00e1ln?\u0301m. Pr\u00e1ca Morausk\u00e9 Pr\u0306irodov\u011bdeck\u00e9 Spolec\u0306nosi\u00a03, 37\u201358 (1926)","journal-title":"Pr\u00e1ca Morausk\u00e9 Pr\u0306irodov\u011bdeck\u00e9 Spolec\u0306nosi"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T19:39:05Z","timestamp":1683229145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11533719_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}