Max-Cut and Max-Bisection are NP-hard on unit disk graphs
Josep DíazMarcin KaminskiPublished in: CoRR (2006)
Keyphrases
- max cut
- np hard
- scheduling problem
- np complete
- optimal solution
- lower bound
- special case
- approximation algorithms
- linear programming
- minimum cost
- knapsack problem
- branch and bound algorithm
- computational complexity
- worst case
- greedy heuristic
- np complete problems
- constraint satisfaction problems
- graph model
- graph partitioning
- planar graphs
- decision problems
- spectral graph
- multiscale