Work

The approximability of NP-hard problems

Year: 1998

Type: conference-paper

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/276698.276784

Author: Sanjeev Arora

Institution: Princeton University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2078744297

FWCI: 0.638

Cites: 132

Cited by: 75

Related to: 10