Finding (s, d)-Hypernetworks in F-Hypergraphs is NP-Hard.

Reynaldo Gil Pons Max Ward Loïc Miller

Published in: CoRR (2022)

Keyphrases

np hard
scheduling problem
lower bound
minimum cost
approximation algorithms
branch and bound algorithm
greedy heuristic
database
graph theory
knapsack problem
closely related
search algorithm
data structure
optimal solution
knowledge base
artificial intelligence
genetic algorithm