Finding Good Approximate Vertex and Edge Partitions is NP-Hard.
Thang Nguyen BuiCurt JonesPublished in: Inf. Process. Lett. (1992)
Keyphrases
- np hard
- vertex set
- undirected graph
- approximation algorithms
- approximate solutions
- strongly connected
- special case
- edge detection
- scheduling problem
- linear programming
- edge information
- closely related
- minimum cost
- website
- integer programming
- edge detector
- worst case
- optimal solution
- np complete
- computational complexity
- approximation ratio
- image processing
- finding the optimal solution