Abstract
We consider the problem of hitting sets online for several families of hypergraphs.
Given a graph G = (V,E), let H = (V,R) denote the hypergraph whose hyperedges are the subsets U ⊆ V such that the induced subgraph G[U] is connected. We establish a new connection between the best competitive ratio for the online hitting set problem in H and the vertex ranking number of G. This connection states that these two parameters are equal. Moreover, this equivalence is algorithmic in the sense, that given an algorithm to compute a vertex ranking of G with k colors, one can use this algorithm as a black-box in order to design a k-competitive deterministic online hitting set algorithm for H. Also, given a deterministic k-competitive online algorithm for H, we can use it as a black box in order to compute a vertex ranking for G with at most k colors. As a corollary, we obtain optimal online hitting set algorithms for many such hypergraphs including those realized by planar graphs, graphs with bounded tree width, trees, etc. This improves the best previously known and more general bound of Alon et al.
We also consider two geometrically defined hypergraphs. The first one is defined by subsets of a given set of n points in the Euclidean plane that are induced by half-planes. We obtain an O(logn)-competitive ratio. We also prove an Ω(logn) lower bound for the competitive ratio in this setting. The second hypergraph is defined by subsets of a given set of n points in the plane induced by unit discs. Since the number of subsets in this setting is O(n 2), the competitive ratio obtained by Alon et al. is O(log2 n). We introduce an algorithm with O(logn)-competitive ratio. We also show that any online algorithm for this problem has a competitive ratio of Ω(logn), and hence our algorithm is optimal.
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
Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: The Online Set Cover Problem. SIAM Journal on Computing 39, 361 (2009)
Borodin, A., El-Yaniv, R.: Online computation and competitive analysis, vol. 2. Cambridge University Press, Cambridge (1998)
Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete and Computational Geometry 14(1), 463–479 (1995)
Ben-Moshe, B., Katz, M.J., Mitchell, J.S.B.: A constant-factor approximation algorithm for optimal terrain guarding. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 515–524. SIAM, Philadelphia (2005)
Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233–235 (1979)
Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. Discrete and Computational Geometry 37(1), 43–58 (2007)
Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks. SIAM Journal on Computing 33, 94–136 (2003)
Even, G., Rawitz, D., Shahar, S.M.: Hitting sets when the VC-dimension is small. Information Processing Letters 95(2), 358–362 (2005)
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM (JACM) 45(4), 634–652 (1998)
Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM (JACM) 32(1), 136 (1985)
Iyer, A.V., Ratliff, H.D., Vijayan, G.: Optimal node ranking of trees. Information Processing Letters 28(5), 225–229 (1988)
Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9(3), 256–278 (1974)
Karp, R.M.: Reducibility among combinatorial problems. In: Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, pp. 85–103 (1972)
Katchalski, M., McCuaig, W., Seager, S.: Ordered colourings. Discrete Mathematics 142(1-3), 141–154 (1995)
Kumar, V.S.A., Ramesh, H.: Covering rectilinear polygons with axis-parallel rectangles. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 445–454. ACM, New York (1999)
Liu, J.W.H.: Computational models and task scheduling for parallel sparse cholesky factorization. Parallel Computing 3(4), 327–342 (1986)
Schäffer, A.A.: Optimal node ranking of trees in linear time. Information Processing Letters 33(2), 91–96 (1989)
Sen, A., Deng, H., Guha, S.: On a graph partition problem with application to VLSI layout. Information Processing Letters 43(2), 87–94 (1992)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Even, G., Smorodinsky, S. (2011). Hitting Sets Online and Vertex Ranking. In: Demetrescu, C., Halldórsson, M.M. (eds) Algorithms – ESA 2011. ESA 2011. Lecture Notes in Computer Science, vol 6942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23719-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-23719-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23718-8
Online ISBN: 978-3-642-23719-5
eBook Packages: Computer ScienceComputer Science (R0)