Streaming Lower Bounds for Approximating MAX-CUT.
Michael KapralovSanjeev KhannaMadhu SudanPublished in: SODA (2015)
Keyphrases
- max cut
- lower bound
- np hard
- upper bound
- graph model
- planar graphs
- branch and bound algorithm
- branch and bound
- data streams
- objective function
- np complete problems
- optimal solution
- scheduling problem
- np complete
- spectral graph
- worst case
- upper and lower bounds
- decision problems
- approximation algorithms
- graph partitioning
- linear programming
- computational complexity
- linear programming relaxation
- min max
- lower and upper bounds
- minimum cost
- max sat
- combinatorial problems
- integer programming
- knapsack problem