Minimum Bisection is NP-hard on Unit Disk Graphs.
Josep DíazGeorge B. MertziosPublished in: CoRR (2014)
Keyphrases
- np hard
- minimum cost
- spanning tree
- approximation algorithms
- undirected graph
- scheduling problem
- graph matching
- np complete
- lower bound
- special case
- vertex set
- branch and bound algorithm
- optimal solution
- closely related
- greedy approximation algorithm
- knapsack problem
- linear programming
- square error
- graph structure
- graph mining
- remains np hard
- min sum
- graph theory
- series parallel
- np hardness
- graph representation
- complex networks
- worst case
- graph databases
- complex structures
- graph partitioning
- graph model
- clustering algorithm
- integer programming
- decision problems
- computational complexity
- connected dominating set
- bayesian networks