ESA 2011: Algorithms – ESA 2011 pp 799-810 | Cite as
Cover-Decomposition and Polychromatic Numbers
Conference paper
Abstract
A colouring of a hypergraph’s vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number, is the maximum number of disjoint hyperedge-covers. In geometric settings, there is extensive work on lower-bounding these numbers in terms of their trivial upper bounds (minimum hyperedge size & degree). Our goal is to get good lower bounds in natural hypergraph families not arising from geometry. We obtain algorithms yielding near-tight bounds for three hypergraph families: those with bounded hyperedge size, those representing paths in trees, and those with bounded VC-dimension. To do this, we link cover-decomposition to iterated relaxation of linear programs via discrepancy theory.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Gupta, R.P.: On the chromatic index and the cover index of a mulltigraph. In: Alavi, Y., Lick, D.R. (eds.) Theory and Applications of Graphs: Int. Conf. Kalamazoo, May 11-15. Lecture Notes in Mathematics, vol. 642, pp. 204–215. Springer, Heidelberg (1976)CrossRefGoogle Scholar
- 2.Andersen, L.D.: Lower bounds on the cover-index of a graph. Discrete Mathematics 25, 199–210 (1979)MathSciNetCrossRefMATHGoogle Scholar
- 3.Alon, N., Berke, R., Buchin, K., Buchin, M., Csorba, P., Shannigrahi, S., Speckmann, B., Zumstein, P.: Polychromatic colorings of plane graphs. Discrete & Computational Geometry 42(3), 421–442 (2009); Preliminary version appeared in Proc. 24th SOCG, pp. 338–345 (2008)Google Scholar
- 4.Pálvölgyi, D.: Decomposition of Geometric Set Systems and Graphs. PhD thesis, École Polytechnique Fédérale de Lausanne, arXiv:1009.4641 (2010)Google Scholar
- 5.Elekes, M., Mátrai, T., Soukup, L.: On splitting infinite-fold covers. Fund. Math. 212, 95–127 (2011); arXiv:0911.2774Google Scholar
- 6.Könemann, J., Parekh, O., Pritchard, D.: Max-weight integral multicommodity flow in spiders and high-capacity trees. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol. 5426, pp. 1–14. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 7.Pach, J., Tardos, G., Tóth, G.: Indecomposable coverings. Canadian Mathematical Bulletin 52, 451-463 (2009); Preliminary version in Proc. 7th CJCDGCGT (2005), pp. 135-148 (2007)Google Scholar
- 8.Moser, R.A., Tardos, G.: A constructive proof of the general Lovász Local Lemma. J. ACM 57 (2010); Preliminary version in Proc. 41st STOC, pp. 343–350 (2009)Google Scholar
- 9.Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: Proc. 18th SODA, pp. 1056–1063 (2007)Google Scholar
- 10.Gibson, M., Varadarajan, K.: Decomposing coverings and the planar sensor cover problem. In: Proc. 50th FOCS, pp. 159–168 (2009)Google Scholar
- 11.Pach, J., Tardos, G.: Tight lower bounds for the size of epsilon-nets. In: Proc 27th SoCG, pp. 458–463 (2011) arXiv:1012.1240Google Scholar
- 12.Feige, U., Halldórsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. Comput. 32, 172–195 (2002); Preliminary version appeared in Proc. 32nd STOC, pp. 134–143 (2000)Google Scholar
- 13.Călinescu, G., Chekuri, C., Vondrák, J.: Disjoint bases in a polymatroid. Random Struct. Algorithms 35, 418–430 (2009)MathSciNetCrossRefMATHGoogle Scholar
- 14.Pach, J.: Decomposition of multiple packing and covering. In: Kolloquium über Diskrete Geometrie, Salzburg, Inst. Math. U. Salzburg, pp. 169–178 (1980)Google Scholar
- 15.Aloupis, G., Cardinal, J., Collette, S., Imahori, S., Korman, M., Langerman, S., Schwartz, O., Smorodinsky, S., Taslakian, P.: Colorful strips. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 2–13. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 16.Keszegh, B., Pálvölgyi, D.: Octants are cover decomposable (2011); arXiv:1101.3773 Google Scholar
- 17.Keszegh, B.: Weak conflict free colorings of point sets and simple regions. In: Proc. 19th CCCG (2007); Extended version “Coloring half-planes and bottomless rectangles” at arXiv:1105.0169Google Scholar
- 18.Cheriyan, J., Jordán, T., Ravi, R.: On 2-coverings and 2-packings of laminar families. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 510–520. Springer, Heidelberg (1999)Google Scholar
- 19.Cheilaris, P., Keszegh, B., Pálvölgyi, D.: Unique-maximum and conflict-free colorings for hypergraphs and tree graphs. In: Proc. 7th Japanese-Hungarian Symp. Disc. Math. Appl., pp. 207–216 (2011); arXiv:1002.4210Google Scholar
- 20.Erlebach, T., Jansen, K.: The maximum edge-disjoint paths problem in bidirected trees. SIAM J. Discrete Math. 14, 326–355 (2001); Preliminary version in Proc. 9th ISAAC (1998)Google Scholar
- 21.Erdős, P., Lovász, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Hajnal, A., Rado, R., Sós, V.T. (eds.) Infinite and Finite Sets (Coll. Keszthely, 1973). Colloq. Math. Soc. János Bolyai, vol. 10, pp. 609–627. North-Holland, Amsterdam (1975)Google Scholar
- 22.Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. Wiley, New York (2008)CrossRefMATHGoogle Scholar
- 23.Beck, J., Fiala, T.: “Integer-making” theorems. Discrete Applied Mathematics 3, 1–8 (1981)MathSciNetCrossRefMATHGoogle Scholar
- 24.Thomassen, C.: The even cycle problem for directed graphs. J. Amer. Math. Soc. 5, 217–229 (1992)MathSciNetCrossRefMATHGoogle Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2011