Approximating the domatic number

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 134-143

  Feige, Uriel ^a   Halldórsson, Magnús M ^b   Kortsarz, Guy ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b UNIVERSITY OF ICELAND   (Iceland)

^c OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION HARDNESS; DISJOINT DOMINATING SETS; DOMATIC NUMBER PROBLEM; DOMATIC PARTITION; MAXIMIZATION PROBLEM; POLY-LOGARITHMIC FACTORS; POLYNOMIAL-TIME; ZERO KNOWLEDGE;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS;

GRAPH THEORY;

DOMATIC NUMBERS;

EID: 0033701736     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335321     Document Type: Conference Paper

References (32)

1. N. Alon and J. Spencer. The Probabilistie Method. Wiley, 1992.
2. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308-340, June 1991.
3. J. Beck. An algorithmic approach to the Lovász local lemma. Random Structures and Algorithms, 2:343-365, 1991.
4. C. Berge. Balanced matrices. Math. Programming, 2:19-31, 1972.
5. M. A. Bonucelli. Dominating sets and domatic number of circular arc graphs. Discrete Appl. Math., 12:203-213, 1985.
6. E. J. Cockayne and S. T. Hedetniemi. Towards a theory of domination in graphs. Networks, 7:247-261, 1997.
7. P. Crescenzi and V. Kann. A compendium of NP optimization problems. http ://www.nada.kth.se/theory/problemlist.html, 1999.
8. M. Farber. Domination, independent domination, and duality in strongly chordal graphs. Discrete Appl. Math., 7:115-130, 1984. (Pubitemid 14569660)
9. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(2):634-652, 1998. (Pubitemid 128488790)
10. U. Feige and J. Kilian. Zero knowledge and the chromatic number. J. Comput. Syst. Sci., 57:187-199, Oct. 1998. (Pubitemid 128413164)
11. S. Fujita. On the performance of greedy algorithms for finding maximum r-configurations. In Korea-Japan Joint Workshop on Algorithms and Computation (WAAC99), 1999.
12. S. Fujita, M. Yamashita, and T. Kameda. A study on r-configurations - a resource assignment problem on graphs. SIAM J. Disc. Math., 1999. To appear.
13. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
14. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proofs. J. ACM, 38(3):691-729, 1991.
15. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Domination in Graphs: Advanced Topics. Marcel Dekker, 1998.
16. T. W. Haynes, S. T. Hedetniemi, and P. J. Slater. Fundamentals of Domination in Graphs. Marcel Dekker, 1998.
17. D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9:256-278, 1974.
18. H. Kaplan and R. Shamir. The domatic number problem on some perfect graph families. Inf. Process. Lett., 49(1):51-56, 1994. (Pubitemid 124012530)
19. S. Khanna, M. Sudan, and D. Williamson. A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction. In Proc. 29th Annual ACM Symposium on Theory of Computing, 1997.
20. J. Kratochvíl. Regular codes in regular graphs are difficult. Discrete Math., 133:191-205, 1994.
21. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Math., 13:383-390, 1975.
22. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. J. ACM, 41(5):960-981, 1994.
23. F. MacWilliams and N. Sloane. The Theory of Error Correcting Codes. North Holland, 1983.
24. M. V. Marathe, H. B. Hunt III, and S. S. Ravi. Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs. Discrete Appl. Math., 64:135-149, 1996.
25. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput., 22:838-856, 1993. (Pubitemid 23677151)
26. M. Naor, L. Schulman, and A. Srinivasan. Splitters and near-optimal derandomization. In Proc. 36th Ann. IEEE Symp. on Found. of Comp. Sci., pages 182-191, 1995.
27. A. Paz and S. Moran. Nondeterministic polynomial optimization problems and their approximations. Theoretical Comput. Sci., 15:251-277, 1981.
28. S. L. Peng and M. S. Chang. A simple linear time algorithm for the domatic partition problem on strongly chordal graphs. Inf. Process. Lett., 43:297-300, 1992.
29. E. Petrartk. The hardness of approximation: Gap location. Comput. Complexity, 4:133-157, 1994.
30. A. Proskurowski and J. A. Telle. Complexity of graph covering problems. Nordic J. Computing, 5:173-195, 1998.
31. A. S. Rao and C. P. Rangan. Linear algorithm for domatic number problem on interval graphs. Inf. Process. Lett., 33:29-33, 1989.
32. B. Zelinka. Domatic number and degree of vertices of a graph. Math. Slovaea, 33:145-147, 1983.