Minimum dominating set approximation in graphs of bounded arboricity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6343 LNCS, Issue , 2010, Pages 510-524

  Lenzen, Christoph ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; BOUNDED TREEWIDTH; DISTRIBUTED ALGORITHM; DISTRIBUTED APPROXIMATION ALGORITHM; GRAPH CLASS; MAXIMUM DEGREE; MINIMUM DOMINATING SET; NP-HARD; PLANAR GRAPH; PRIORI KNOWLEDGE; RUNNING TIME; SIMPLE MODIFICATIONS; TIME CONSTANTS;

GRAPH THEORY; GRAPHIC METHODS;

APPROXIMATION ALGORITHMS;

EID: 78649879266     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15763-9_48     Document Type: Conference Paper

References (25)

1. Alon, N., Babai, L., Itai, A.: A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms 7(4), 567-583 (1986)
2. Baker, B.S.: Approximation Algorithms for NP-Complete Problems on Planar Graphs. J. ACM 41(1), 153-180 (1994)
3. Barenboim, L., Elkin, M.: Sublogarithmic Distributed MIS algorithm for Sparse Graphs using Nash-Williams Decomposition. Distributed Computing, 1-17 (2009)
4. Chlebk, M., Chlebkov, J.: Approximation Hardness of Dominating Set Problems in Bounded Degree Graphs. Information and Computation 206(11), 1264-1275 (2008)
5. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Math. 86(1-3), 165-177 (1990)
6. Czygrinow, A., Hańćkowiak, M., Wawrzyniak, W.: Fast Distributed Approximations in Planar Graphs. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 78-92. Springer, Heidelberg (2008)
7. Czygrinow, A., Hańćkowiak, M.: Distributed Almost Exact Approximations for Minor-Closed Families. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 244-255. Springer, Heidelberg (2006)
8. Czygrinow, A., Hanckowiak, M.: Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 515-525. Springer, Heidelberg (2007)
9. Eppstein, D.: Diameter and Treewidth in Minor-Closed Graph Families. Algorithmica 27(3), 275-291 (2000)
10. Feige, U.: A Threshold of lnn for Approximating Set Cover. J. ACM 45(4), 634-652 (1998)
11. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
12. Grohe, M.: Local Tree-Width, Excluded Minors, and Approximation Algorithms. Combinatorica 23(4), 613-632 (2003)
13. 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 26(2), 238-274 (1998)
14. Kuhn, F.: Personal Communication (2010)
15. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What Cannot Be Computed Locally! In: Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC (2004)
16. Kuhn, F., Moscibroda, T., Wattenhofer, R.: The Price of Being Near-Sighted. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms, SODA (2006)
17. Kuhn, F., Wattenhofer, R.: Constant-Time Distributed Dominating Set Approximation. Distrib. Comput. 17(4), 303-310 (2005)
18. 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)
19. Lenzen, C., Wattenhofer, R.: Leveraging Linial's Locality Limit. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 394-407. Springer, Heidelberg (2008)
20. Linial, N.: Locality in Distributed Graph Algorithms. SIAM Journal on Computing 21(1), 193-201 (1992)
21. Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 15(4), 1036-1055 (1986)
22. Métivier, Y., Robson, J.M., Saheb Djahromi, N.,, Z.: An Optimal Bit Complexity Randomised Distributed MIS Algorithm. In: Kutten, S., Žerovnik, J. (eds.) SIROCCO 2009. LNCS, vol. 5869, pp. 1-15. Springer, Heidelberg (2010)
23. 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-484. ACM, New York (1997)
24. 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)
25. Takamizawa, K., Nishizeki, T., Saito, N.: Linear-Time Computability of Combinatorial Problems on Series-Parallel Graphs. J. ACM 29(3), 623-641 (1982)