MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs.
Josep DíazMarcin KaminskiPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- max cut
- np hard
- lower bound
- scheduling problem
- approximation algorithms
- optimal solution
- special case
- np complete
- linear programming
- graph model
- minimum cost
- worst case
- branch and bound algorithm
- computational complexity
- decision problems
- constraint satisfaction problems
- greedy heuristic
- np complete problems
- knapsack problem
- planar graphs
- spectral graph
- image segmentation