Streaming Lower Bounds for Approximating MAX-CUT.
Michael KapralovSanjeev KhannaMadhu SudanPublished in: CoRR (2014)
Keyphrases
- max cut
- lower bound
- np hard
- upper bound
- branch and bound algorithm
- graph model
- data streams
- planar graphs
- branch and bound
- graph partitioning
- worst case
- optimal solution
- spectral graph
- np complete
- lower and upper bounds
- np complete problems
- upper and lower bounds
- scheduling problem
- objective function
- approximation algorithms
- integer programming
- clustering algorithm
- similarity measure
- image segmentation