Work

Approximate graph coloring by semidefinite programming

Year: 2002

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1994.365710

Authors: D. Karger, R. Motwani, M. Sudan

Institutions: Stanford University, IBM Research - Thomas J. Watson Research Center

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funders: National Science Foundation, Schlumberger Foundation

Awards: Randomness and Algorithms, NYI: The Complexity of Probablistic Algorithms

OpenAlex ID: W2162018802

FWCI: 4.959

Cites: 44

Cited by: 103

Related to: 10