Login / Signup
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs.
Philip N. Klein
Hsueh-I Lu
Published in:
ISAAC (1998)
Keyphrases
</>
approximation algorithms
space efficient
semidefinite
semidefinite programming
primal dual
np hard
special case
data structure
interior point methods
data streams
worst case
sliding window
convex relaxation
bloom filter
sufficient conditions
linear programming
convex sets
higher dimensional
data sets
b tree