)-hypernetworks in F-hypergraphs is NP-hard.
Reynaldo Gil PonsMax WardLoïc MillerPublished in: Inf. Process. Lett. (2024)
Keyphrases
- np hard
- np complete
- approximation algorithms
- linear programming
- lower bound
- optimal solution
- special case
- scheduling problem
- constraint satisfaction problems
- closely related
- integer programming
- branch and bound algorithm
- worst case
- decision problems
- computational complexity
- minimum cost
- greedy heuristic
- graph theory
- np hardness
- randomly generated problem instances
- database
- remains np hard
- upper bound
- knapsack problem
- set cover
- neural network