Some NP-hard Polygon Cover Problems.
Hans-Dietrich HeckerDietmar HerwigPublished in: J. Inf. Process. Cybern. (1989)
Keyphrases
- np hard
- np complete
- approximate solutions
- data mining
- website
- np hardness
- special case
- optimization problems
- real time
- decision problems
- closely related
- linear programming
- feature space
- case study
- np hard problems
- computationally challenging
- problems involving
- benchmark problems
- combinatorial optimization
- scheduling problem
- search algorithm
- neural network
- data sets