Restricted optimal pebbling is NP-hard.

László F. Papp

Published in: Discret. Appl. Math. (2024)

Keyphrases

np hard
optimal solution
worst case
greedy heuristic
lower bound
minimum cost
special case
genetic algorithm
reinforcement learning
computational complexity
dynamic programming
linear programming
knapsack problem
approximation algorithms
randomly generated problem instances