Approximating the Domatic Number
暂无分享,去创建一个
[1] Satoshi Fujita,et al. A Study on r-Configurations - A Resource Assignment Problem on Graphs , 2000, SIAM J. Discret. Math..
[2] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[3] Sheng-Lung Peng,et al. A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs , 1992, Inf. Process. Lett..
[4] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[5] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[6] Jan Kratochivíl,et al. Regular codes in regular graphs are difficult , 1994 .
[7] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[8] Aravind Srinivasan,et al. Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[9] Uriel Feige,et al. Approximating the domatic number , 2000, STOC '00.
[10] Haim Kaplan,et al. The Domatic Number Problem on Some Perfect Graph Families , 1994, Inf. Process. Lett..
[11] Ran Raz. A Parallel Repetition Theorem , 1998, SIAM J. Comput..
[12] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[13] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[16] Uriel Feige,et al. Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..
[17] Shlomo Moran,et al. Non Deterministic Polynomial Optimization Problems and their Approximations , 1977, Theor. Comput. Sci..
[18] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[19] Martin Farber,et al. Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..
[20] Maurizio A. BONUCCELLI. Dominating sets and domatic number of circular arc graphs , 1985, Discret. Appl. Math..
[21] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[22] Jan Kratochvíl,et al. On the Complexity of Graph Covering Problems , 1994, Nord. J. Comput..
[23] C. Pandu Rangan,et al. Linear Algorithm for Domatic Number Problem on Interval Graphs , 1989, Inf. Process. Lett..
[24] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.