#### DMCA

## Approximate Graph Coloring by Semidefinite Programming. (1994)

### Cached

### Download Links

- [www.al.cm.is.nagoya-u.ac.jp]
- [theory.csail.mit.edu]
- [theory.lcs.mit.edu]
- [people.csail.mit.edu]
- [theory.lcs.mit.edu]
- [theory.lcs.mit.edu]
- [arxiv.org]
- [arxiv.org]
- [ftp.cs.umd.edu]
- [www.wisdom.weizmann.ac.il]
- [theory.lcs.mit.edu]
- [theory.stanford.edu]
- [karush.rutgers.edu]
- [clweb.csa.iisc.ernet.in]
- [people.csail.mit.edu]

by
David Karger
,
Rajeev Motwani
,
D Karger
,
M Sudan

Venue: | In Proceedings of 35th Annual IEEE Symposium on Foundations of Computer Science, |

Citations: | 210 - 7 self |