Minimum bisection is NP-hard on unit disk graphs.
Josep DíazGeorge B. MertziosPublished in: Inf. Comput. (2017)
Keyphrases
- np hard
- minimum cost
- spanning tree
- special case
- approximation algorithms
- scheduling problem
- optimal solution
- greedy approximation algorithm
- vertex set
- closely related
- bipartite graph
- graph construction
- undirected graph
- connected dominating set
- linear programming
- maximum weight
- approximation guarantees
- graph theoretic
- weighted graph
- directed graph
- computational complexity
- graph databases
- lower bound
- worst case
- graph matching
- square error
- graph kernels
- greedy heuristic
- constant factor
- computationally hard
- pattern recognition
- neural network