Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Constructing worst case instances for semidefinite programming based approximation algorithms
Noga Alon
, Benny Sudakov, Uri Zwick
Research output
:
Contribution to journal
›
Article
›
peer-review
9
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Constructing worst case instances for semidefinite programming based approximation algorithms'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Algorithms
100%
Semidefinite Programming
100%
Tight
66%
Williamson
66%
Relative Size
33%
MaxCut
33%
Maximum Cut
33%
Performance Guarantee
33%
Local Analysis
33%
Max-cut Problem
33%
Local Ratio Technique
33%
Mathematics
Worst Case
100%
Relative Size
100%