Abstract
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant time algorithm ? Motivated by results and questions of Nguyen and Onak, and of Parnas, Ron and Trevisan, we show that the best approximation ratio that can be achieved for the first question (independence number) is between Ω(d/logd) and O(d loglogd/ logd), whereas the answer to the second (domination number) is (1 + o(1)) ln d.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajtai, M., Erdös, P., Komlós, J., Szemerédi, E.: On Turan’s theorem for sparse graphs. Combinatorica 1, 313–317 (1981)
Alon, N.: Independence numbers of locally sparse graphs and a Ramsey type problem. Random Structures and Algorithms 9, 271–278 (1996)
Alon, N., Kahale, N.: Approximating the independence number via the θ-function. Math. Programming 80, 253–264 (1998)
Alon, N., Wormald, N.: High degree graphs contain large-star factors. In: Katona, G., Schrijver, A., Szönyi, T. (eds.) Fete of Combinatorics, Bolyai Soc. Math. Studies 20, pp. 9–21. Springer, Heidelberg (2010)
Austrin, P., Khot, S., Safra, M.: Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. In: IEEE Conference on Computational Complexity 2009, pp. 74–80 (2009)
Erdös, P., Sachs, H.: Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl (German). Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 12, 251–257 (1963)
Goldreich, O., Ron, D.: Property testing in bounded degree graphs. In: Proc. 29th STOC, pp. 406–415 (1997)
Halldórsson, M.M.: Approximations of Independent Sets in Graphs. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 1–13. Springer, Heidelberg (1998)
Halldórsson, M.M.: Approximations of Weighted Independent Set and Hereditary Subset Problems. Journal of Graphs Algorithms and Applications 4, 1–16 (2000)
Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In: Proc. Eleventh ACM-SIAM Symp. on Discrete Algorithms, pp. 329–337 (2000)
Marko, S., Ron, D.: Distance approximation in bounded-degree and general sparse graphs. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 475–486. Springer, Heidelberg (2006)
Nguyen, H.N., Onak, K.: Constant-Time Approximation Algorithms via Local Improvements. In: Proc. 49th Annual Symposium on Foundations of Computer Science (FOCS 2008), pp. 327–336 (2008)
Parnas, M., Ron, D.: Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theoret. Comput. Sci. 381(1-3), 183–196 (2007)
Shearer, J.B.: On the independence number of sparse graphs. Random Structures and Algorithms 7, 269–271 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Alon, N. (2010). On Constant Time Approximation of Parameters of Bounded Degree Graphs. In: Goldreich, O. (eds) Property Testing. Lecture Notes in Computer Science, vol 6390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16367-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-16367-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16366-1
Online ISBN: 978-3-642-16367-8
eBook Packages: Computer ScienceComputer Science (R0)