Work

Semidefinite Programming Based Approximation Algorithms

Year: 2001

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-45294-x_5

Author: Uri Zwick

Institution: Tel Aviv 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: W1489655616

FWCI:

Cites:

Cited by: 1

Related to: 10