{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T07:12:22Z","timestamp":1726384342325},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10878-011-9383-5","type":"journal-article","created":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T16:23:32Z","timestamp":1296059012000},"page":"430-459","source":"Crossref","is-referenced-by-count":4,"title":["A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks"],"prefix":"10.1007","volume":"25","author":[{"given":"Sayaka","family":"Kamei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotsugu","family":"Kakugawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Devismes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,27]]},"reference":[{"key":"9383_CR1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-57271-6_35","volume-title":"Proceedings of the 7th international workshop on distributed algorithms","author":"E Anagnostou","year":"1993","unstructured":"Anagnostou E, Hadzilacos V (1993) Tolerating transient and permanent failures (extended abstract). In: Proceedings of the 7th international workshop on distributed algorithms. LNCS, vol 725. Springer, Berlin, pp 174\u2013188"},{"key":"9383_CR2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/1400751.1400802","volume-title":"Proceedings of the twenty-seventh ACM symposium on principles of distributed computing","author":"M Ben-Or","year":"2008","unstructured":"Ben-Or M, Dolev D, Hoch EN (2008) Fast self-stabilizing byzantine tolerant digital clock synchronization. In: Proceedings of the twenty-seventh ACM symposium on principles of distributed computing, pp\u00a0385\u2013394"},{"key":"9383_CR3","volume-title":"Proceedings of the 23th IEEE international parallel and distributed processing symposium","author":"L Blin","year":"2009","unstructured":"Blin L, Potop-Butucaru M, Rovedakis S (2009) Self-stabilizing minimum-degree spanning tree within one from the optimal degree. In: Proceedings of the 23th IEEE international parallel and distributed processing symposium."},{"key":"9383_CR4","series-title":"LNCS","first-page":"407","volume-title":"Proceedings of the 23rd international symposium on distributed computing","author":"L Blin","year":"2009","unstructured":"Blin L, Potop-Butucaru MG, Rovedakis S, Tixeuil S (2009) A new self-stabilizing minimum spanning tree construction with loop-free property. In: Proceedings of the 23rd international symposium on distributed computing. LNCS, vol 5805. Springer, Berlin, pp 407\u2013422"},{"key":"9383_CR5","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BFb0022152","volume-title":"Proceedings of the 9th international workshop on distributed algorithms","author":"F Butelle","year":"1995","unstructured":"Butelle F, Lavault C, Bui M (1995) A uniform self-stabilizing minimum diameter tree algorithm. In: Proceedings of the 9th international workshop on distributed algorithms. LNCS, vol 972. Springer, Berlin, pp 257\u2013272"},{"key":"9383_CR6","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1006\/jpdc.2001.1830","volume":"62","author":"JA Cobb","year":"2002","unstructured":"Cobb JA, Gouda MG (2002) Stabilization of general loop-free routing. J Parallel Distrib Comput 62:922\u2013944","journal-title":"J Parallel Distrib Comput"},{"key":"9383_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-540-89335-6_11","volume-title":"Proceedings of the 10th international symposium on stabilization, safety, and security of distributed systems","author":"AK Datta","year":"2008","unstructured":"Datta AK, Larmore LL, Vemula P (2008) Self-stabilizing leader election in optimal space. In: Proceedings of the 10th international symposium on stabilization, safety, and security of distributed systems. LNCS, vol 5340. Springer, Berlin, pp 109\u2013123"},{"issue":"11","key":"9383_CR8","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra EW (1974) Self-stabilizing systems in spite of distributed control. Commun ACM 17(11):643\u2013644","journal-title":"Commun ACM"},{"key":"9383_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev S (2000) Self-stabilization. MIT Press, Cambridge"},{"issue":"4","key":"9383_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4086\/cjtcs.1997.004","volume":"3","author":"S Dolev","year":"1997","unstructured":"Dolev S, Herman T (1997) Superstabilizing protocols for dynamic distributed systems. Chic J Theor Comput Sci 3(4):1\u201340","journal-title":"Chic J Theor Comput Sci"},{"issue":"4","key":"9383_CR11","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/PL00009167","volume":"18","author":"S Dolev","year":"1997","unstructured":"Dolev S, Welch JL (1997) Wait-free clock synchronization. Algorithmica 18(4):486\u2013511","journal-title":"Algorithmica"},{"key":"9383_CR12","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1145\/1017460.1017463","volume":"51","author":"S Dolev","year":"2004","unstructured":"Dolev S, Welch JL (2004) Self-stabilizing clock synchronization in the presence of byzantine faults. J\u00a0ACM 51:780\u2013799","journal-title":"J\u00a0ACM"},{"issue":"1","key":"9383_CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0190(94)90139-2","volume":"52","author":"G Galbiati","year":"1994","unstructured":"Galbiati G, Maffioli F, Morzenti A (1994) A short note on the approximability of the maximum leaves spanning tree problem. Inf Process Lett 52(1):45\u201349","journal-title":"Inf Process Lett"},{"key":"9383_CR14","volume-title":"Computers and intractability, a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, New York"},{"key":"9383_CR15","unstructured":"Gartner FC (2003) A survey of self-stabilizing spanning-tree construction algorithms. Technical report, EPFL"},{"key":"9383_CR16","first-page":"195","volume-title":"Proceedings of the 12th annual ACM symposium on principles of distributed computing","author":"AS Gopal","year":"1993","unstructured":"Gopal AS, Perry KJ (1993) Unifying self-stabilization and fault-tolerance (preliminary version). In: Proceedings of the 12th annual ACM symposium on principles of distributed computing, pp 195\u2013206"},{"key":"9383_CR17","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-45032-7_14","volume-title":"Proceedings of the 6th international symposium on self-stabilizing systems","author":"C Johnen","year":"2003","unstructured":"Johnen C, Tixeuil S (2003) Route preserving stabilization. In: Proceedings of the 6th international symposium on self-stabilizing systems. LNCS, vol 2704. Springer, Berlin, pp 184\u2013198"},{"key":"9383_CR18","first-page":"224","volume-title":"Proceedings of the 9th IPDPS workshop on advances in parallel and distributed computational models","author":"S Kamei","year":"2007","unstructured":"Kamei S, Kakugawa H (2007) A self-stabilizing distributed approximation algorithm for the minimum connected dominating set. In: Proceedings of the 9th IPDPS workshop on advances in parallel and distributed computational models. IEEE Comput Soc, Los Alamitos, p 224"},{"key":"9383_CR19","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/jagm.1998.0944","volume":"29","author":"HI Lu","year":"1998","unstructured":"Lu HI, Ravi R (1998) Approximating maximum leaf spanning trees in almost linear time. J Algorithms 29:132\u2013141","journal-title":"J Algorithms"},{"issue":"3","key":"9383_CR20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1142\/S0129626497000334","volume":"7","author":"M Papatriantafilou","year":"1997","unstructured":"Papatriantafilou M, Tsigas P (1997) On self-stabilizing wait-free clock synchronization. Parallel Process Lett 7(3):321\u2013328","journal-title":"Parallel Process Lett"},{"key":"9383_CR21","first-page":"526","volume-title":"Proceedings of the 11th international conference on advanced communication technology","author":"H Raei","year":"2009","unstructured":"Raei H, Tabibzadeh M, Ahmadipoor B, Saei S (2009) A self-stabilizing distributed algorithm for minimum connected dominating sets in wireless sensor networks with different transmission ranges. In: Proceedings of the 11th international conference on advanced communication technology. IEEE Comput Soc, Los Alamitos, pp 526\u2013530"},{"key":"9383_CR22","series-title":"LNCS","first-page":"441","volume-title":"Proceedings of the 6th annual European symposium on algorithms","author":"R Solis-Oba","year":"1998","unstructured":"Solis-Oba R (1998) 2-approximation algorithm for finding a spanning tree with maximum number of leaves. In: Proceedings of the 6th annual European symposium on algorithms. LNCS, vol 1461. Springer, Berlin, pp 441\u2013452"},{"key":"9383_CR23","series-title":"Chapman & Hall\/CRC applied algorithms and data structures","volume-title":"Algorithms and theory of computation handbook","author":"S Tixeuil","year":"2009","unstructured":"Tixeuil S (2009) Self-stabilizing algorithms. In: Algorithms and theory of computation handbook, 2nd edn. Chapman & Hall\/CRC applied algorithms and data structures. Taylor & Francis, London.","edition":"2"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9383-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T04:14:53Z","timestamp":1559967293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9383-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,27]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9383"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9383-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,27]]}}}