{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:22:23Z","timestamp":1760440943241},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_48","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"510-524","source":"Crossref","is-referenced-by-count":25,"title":["Minimum Dominating Set Approximation in Graphs of Bounded Arboricity"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Lenzen","sequence":"first","affiliation":[]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"48_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms\u00a07(4), 567\u2013583 (1986)","journal-title":"J. Algorithms"},{"issue":"1","key":"48_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation Algorithms for NP-Complete Problems on Planar Graphs. J. ACM\u00a041(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Sublogarithmic Distributed MIS algorithm for Sparse Graphs using Nash-Williams Decomposition. Distributed Computing, 1\u201317 (2009)","DOI":"10.1145\/1400751.1400757"},{"issue":"11","key":"48_CR4","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M. Chlebk","year":"2008","unstructured":"Chlebk, M., Chlebkov, J.: Approximation Hardness of Dominating Set Problems in Bounded Degree Graphs. Information and Computation\u00a0206(11), 1264\u20131275 (2008)","journal-title":"Information and Computation"},{"issue":"1-3","key":"48_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Math.\u00a086(1-3), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"48_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-87779-0_6","volume-title":"Distributed Computing","author":"A. Czygrinow","year":"2008","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Wawrzyniak, W.: Fast Distributed Approximations in Planar Graphs. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 78\u201392. Springer, Heidelberg (2008)"},{"key":"48_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/11841036_24","volume-title":"Algorithms \u2013 ESA 2006","author":"A. Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed Almost Exact Approximations for Minor-Closed Families. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 244\u2013255. Springer, Heidelberg (2006)"},{"key":"48_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-73545-8_50","volume-title":"Computing and Combinatorics","author":"A. Czygrinow","year":"2007","unstructured":"Czygrinow, A., Hanckowiak, M.: Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 515\u2013525. Springer, Heidelberg (2007)"},{"issue":"3","key":"48_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and Treewidth in Minor-Closed Graph Families. Algorithmica\u00a027(3), 275\u2013291 (2000)","journal-title":"Algorithmica"},{"issue":"4","key":"48_CR10","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A Threshold of ln n for Approximating Set Cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"48_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"4","key":"48_CR12","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00493-003-0037-9","volume":"23","author":"M. Grohe","year":"2003","unstructured":"Grohe, M.: Local Tree-Width, Excluded Minors, and Approximation Algorithms. Combinatorica\u00a023(4), 613\u2013632 (2003)","journal-title":"Combinatorica"},{"issue":"2","key":"48_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"H.B. Hunt","year":"1998","unstructured":"Hunt, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. Journal of Algorithms\u00a026(2), 238\u2013274 (1998)","journal-title":"Journal of Algorithms"},{"key":"48_CR14","unstructured":"Kuhn, F.: Personal Communication (2010)"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What Cannot Be Computed Locally! In: Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC (2004)","DOI":"10.1145\/1011767.1011811"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The Price of Being Near-Sighted. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms, SODA (2006)","DOI":"10.1145\/1109557.1109666"},{"issue":"4","key":"48_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00446-004-0112-5","volume":"17","author":"F. Kuhn","year":"2005","unstructured":"Kuhn, F., Wattenhofer, R.: Constant-Time Distributed Dominating Set Approximation. Distrib. Comput.\u00a017(4), 303\u2013310 (2005)","journal-title":"Distrib. Comput."},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Oswald, Y.A., Wattenhofer, R.: What can be Approximated Locally? In: 20th ACM Symposium on Parallelism in Algorithms and Architecture, SPAA (June 2008)","DOI":"10.1145\/1378533.1378540"},{"key":"48_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-540-87779-0_27","volume-title":"Distributed Computing","author":"C. Lenzen","year":"2008","unstructured":"Lenzen, C., Wattenhofer, R.: Leveraging Linial\u2019s Locality Limit. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 394\u2013407. Springer, Heidelberg (2008)"},{"issue":"1","key":"48_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in Distributed Graph Algorithms. SIAM Journal on Computing\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"48_CR21","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput.\u00a015(4), 1036\u20131055 (1986)","journal-title":"SIAM J. Comput."},{"key":"48_CR22","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Structural Information and Communication Complexity","author":"Y. M\u00e9tivier","year":"2010","unstructured":"M\u00e9tivier, Y., Robson, J.M., Saheb Djahromi, N., Zemmari, A.: An Optimal Bit Complexity Randomised Distributed MIS Algorithm. In: Proc. 16th International Colloquium on Structural Information and Communication Complexity. pp. 1\u201315. Piran Slovenia (2009)"},{"key":"48_CR23","first-page":"475","volume-title":"Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC)","author":"R. Raz","year":"1997","unstructured":"Raz, R., Safra, S.: A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. In: Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 475\u2013484. ACM, New York (1997)"},{"key":"48_CR24","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs. In: Proc. of the 27th Annual ACM Symposium on Principles of Distributed Computing, PODC (August 2008)","DOI":"10.1145\/1400751.1400758"},{"issue":"3","key":"48_CR25","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-Time Computability of Combinatorial Problems on Series-Parallel Graphs. J. ACM\u00a029(3), 623\u2013641 (1982)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:52Z","timestamp":1606185592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}