Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration.

Shuichi Hirahara Naoto Ohsaka

Published in: CoRR (2024)

Keyphrases

set cover
np hard
greedy algorithm
worst case
greedy heuristic
approximation algorithms
optimal solution
network flow
machine learning
greedy heuristics
np complete
dynamic programming
optimization algorithm
scheduling problem
solution space
manufacturing systems
integer programming
computational complexity