Approximating the domatic number

Authors:
Uriel Feige;Magnús M. Halldórsson;Guy Kortsarz
Affiliations:
Weizmann Institute, Rehovot, Israel;Science Institute-U. Iceland, Reykjavik, Iceland and School of Informatics, Kyoto University, Japan;Open University, Ramat Aviv, Israel
Venue:
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Year:
2000

Citing 18
Cited 10

Linear algorithm for domatic number problem on interval graphs

Information Processing Letters
Easy problems for tree-decomposable graphs

Journal of Algorithms
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs

Information Processing Letters
Small-bias probability spaces: efficient constructions and applications

SIAM Journal on Computing
The domatic number problem on some perfect graph families

Information Processing Letters
Regular codes in regular graphs are difficult

Discrete Mathematics
The hardness of approximation: gap location

Computational Complexity
Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs

Discrete Applied Mathematics
A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Zero knowledge and the chromatic number

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
A Study on r-Configurations---A Resource Assignment Problem on Graphs

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity of graph covering problems

Nordic Journal of Computing
Splitters and near-optimal derandomization

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
An algorithmic approach to the lovász local lemma. I

Random Structures & Algorithms

Domatic partitions and the Lovász local lemma

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximating Min-sum Set Cover

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Hardness of approximating the Shortest Vector Problem in high ℓp norms

Journal of Computer and System Sciences - Special issue on FOCS 2003
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The NP-completeness column: The many limits on approximation

ACM Transactions on Algorithms (TALG)
An improved exact algorithm for the domatic number problem

Information Processing Letters
Maximum agreement and compatible supertrees

Journal of Discrete Algorithms
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Cover-decomposition and polychromatic numbers

ESA'11 Proceedings of the 19th European conference on Algorithms
Connected dominating set algorithms for wireless sensor networks

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Approximating the domatic number

Quantified Score

Visualization

Abstract