The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Approximate graph coloring by semidefinite programming
Abstract
We consider the problem of coloring k -colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3-colorable graph on n vertices with min{ O (Δ 1/3 log 1/2 Δ log n ), O ( n 1/4 log 1/2 n )} colors where Δ is the maximum degree of any vertex. Besides giving the best known approximation ratio in terms of n , this marks the first nontrivial approximation result as a function of the maximum degree Δ. This result can be generalized to k -colorable graphs to obtain a coloring using min{ O (Δ 1-2/ k log 1/2 Δ log n ), O ( n 1−3/( k +1) log 1/2 n )} colors. Our results are inspired by the recent work of Goemans and Williamson who used an algorithm for semidefinite optimization problems , which generalize linear programs, to obtain improved approximations for the MAX CUT and MAX 2-SAT problems. An intriguing outcome of our work is a duality relationship established between the value of the optimum solution to our semidefinite program and the Lovász θ-function. We show lower bounds on the gap between the optimum solution of our semidefinite program and the actual chromatic number; by duality this also demonstrates interesting new facts about the θ-function.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Self-citationGoemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
On the Shannon capacity of a graph
Lovasz, L. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055985 · Cited by 1,624
Clique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
An Introduction To Probability Theory And Its Applications
Feller, W. (1950) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 1,246
An Introduction to Probability Theory and Its Applications.
Cox, D. R., & Feller, W. (1958) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2342907 · Cited by 1,083
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Alizadeh, F. (1995) · SIAM Journal on Optimization · doi:10.1137/0805002 · Cited by 892
On the hardness of approximating minimization problems
Lund, C., & Yannakakis, M. (1994) · Journal of the ACM · doi:10.1145/185675.306789 · Cited by 872
Register allocation & spilling via graph coloring
Chaitin, G. J. (1982) · ACM SIGPLAN Notices · doi:10.1145/872726.806984 · Cited by 767
Proof verification and hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267823 · Cited by 741
Self-citationRegister allocation via coloring
Chaitin, G. J., Auslander, M. A., Chandra, A. K., Cocke, J., Hopkins, M. E., & Markstein, P. W. (1981) · Computer Languages · doi:10.1016/0096-0551(81)90048-5 · Cited by 737
Register allocation & spilling via graph coloring
Chaitin, G. J. (1982) · Proceedings of the 1982 SIGPLAN symposium on Compiler construction - SIGPLAN '82 · doi:10.1145/800230.806984 · Cited by 666
Probability Approximations via the Poisson Clumping Heuristic
Aldous, D. (1989) · Applied Mathematical Sciences · doi:10.1007/978-1-4757-6283-9 · Cited by 544
Interactive proofs and the hardness of approximating cliques
Feige, U., Goldwasser, S., Lovász, L., Safra, M., & Szegedy, M. (1996) · Journal of the ACM · doi:10.1145/226643.226652 · Cited by 525
Geometric Algorithms and Combinatorial Optimization
Leung, J. M. Y., Grötschel, M., Lovász, L., & Schrijver, A. (1989) · Journal of the Operational Research Society · doi:10.2307/2583689 · Cited by 435
Improved approximation algorithms for MAXk-CUT and MAX BISECTION
Frieze, A., & Jerrum, M. (1997) · Algorithmica · doi:10.1007/bf02523688 · Cited by 406
Approximating clique is almost NP-complete
Feige, U., Goldwasser, S., Lovasz, L., Safra, S., & Szegedy, M. (2002) · [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science · doi:10.1109/sfcs.1991.185341 · Cited by 396
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Knuth, D. E. (1978) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 369
Approximating maximum independent sets by excluding subgraphs
Boppana, R., & Halldórsson, M. M. (1992) · BIT · doi:10.1007/bf01994876 · Cited by 359
Knuth, D. E. (1994) · The Electronic Journal of Combinatorics · doi:10.37236/1193 · Cited by 296
A still better performance guarantee for approximate graph coloring
Halldórsson, M. M. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90246-6 · Cited by 224
878-approximation Algorithms for MAX CUT and MAX 2SAT
Goemans, M. X. (1994) · Symposium on the Theory of Computing · Cited by 173
Improved non-approximability results
Bellare, M., & Sudan, M. (1994) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/195058.195129 · Cited by 162
Self-citationFrankl, P., & Rödl, V. (1987) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1987-0871675-6 · Cited by 159
Coloring heuristics for register allocation
Briggs, P., Cooper, K. D., Kennedy, K., et al. (2004) · ACM SIGPLAN Notices · doi:10.1145/989393.989424 · Cited by 157
Alon, N., Feige, U., Wigderson, A., & Zuckerman, D. (1995) · Computational Complexity · doi:10.1007/bf01277956 · Cited by 152
Approximating the independence number via theϑ-function
Alon, N., & Kahalé, N. (1998) · Mathematical Programming · doi:10.1007/bf01581168 · Cited by 128
Improved approximation algorithms for MAX k-CUT and MAX BISECTION
FRIEZE, A. M., & Jerrum, M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59408-6_37 · Cited by 110
On syntactic versus computational views of approximability
Khanna, S., Motwani, R., Sudan, M., & Vazirani, U. V. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365712 · Cited by 107
Self-citationDerandomizing semidefinite programming based approximation algorithms
Mahajan, S., & Ramesh, H. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492473 · Cited by 68
Randomized graph products, chromatic numbers, and Lovasz j-function
Feige, U. (1995) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/225058.225281 · Cited by 64
Derandomizing semidefinite programming based approximation algorithms
Hariharan, R., & Mahajan, S. (1995) · Max Planck Institute for Plasma Physics · Cited by 29
Proof verification and the hardness of approximation problems.
Arora, S., Lund, C., Motwani, R., et al. (1998) · Cited by 26
Self-citation
Cited by
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Towards Sharp Inapproximability For Any 2-CSP
Austrin, P. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.41 · Cited by 1,294
Property testing and its connection to learning and approximation
Goldreich, O., Goldwasser, S., & Ron, D. (1998) · Journal of the ACM · doi:10.1145/285055.285060 · Cited by 1,020
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
Bellare, M., Goldreich, O., & Sudan, M. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539796302531 · Cited by 453
Self-citationSome applications of Laplace eigenvalues of graphs
Mohar, B. (1997) · Graph Symmetry · doi:10.1007/978-94-015-8937-6_6 · Cited by 422
Metadata
- Authors
- Karger, D., Motwani, R., & Sudan, M.
- Venue
- Journal of the ACM
- Published
- 1998-03
- Volume
- 45
- Issue
- 2
- Pages
- 246-265
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2069816168
- Cited by
- 420
- References
- 41
- FWCI
- 21.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.