Minimum Bisection Is NP-hard on Unit Disk Graphs.
Josep DíazGeorge B. MertziosPublished in: MFCS (2) (2014)
Keyphrases
- np hard
- minimum cost
- spanning tree
- approximation algorithms
- optimal solution
- scheduling problem
- lower bound
- undirected graph
- graph matching
- np complete
- integer programming
- special case
- closely related
- greedy heuristic
- linear programming
- worst case
- graph theory
- np hardness
- graph theoretic
- greedy approximation algorithm
- computational complexity
- connected dominating set
- graph mining
- subgraph isomorphism
- graph databases
- graph model
- maximum weight
- dominating set
- decision problems
- approximation guarantees
- constant factor
- randomly generated problem instances
- neural network
- remains np hard
- approximation ratio
- set cover
- graph representation
- graph partitioning
- graph structure
- bipartite graph
- branch and bound algorithm
- linear program
- pattern recognition
- learning algorithm