Skip to Main Content Area
CPS-VO
Contact Support
Browse
Calendar
Announcements
Repositories
Groups
Search
Search for Content
Search for a Group
Search for People
Search for a Project
Tagcloud
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
Sparsest Cut Problem
biblio
The Integrality Gap of the Goemans-Linial SDP Relaxation for Sparsest Cut Is at Least a Constant Multiple of $\surd$Log N
Submitted by grigby1 on Mon, 03/26/2018 - 1:09pm
Approximation algorithms
metric embeddings
Metrics
pubcrawl
resilience
Resiliency
Scalability
semidefinite programming
Sparsest Cut Problem
work factor metrics