Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration.

Shuichi Hirahara Naoto Ohsaka

Published in: ICALP (2024)

Keyphrases

set cover
np hard
worst case
greedy algorithm
greedy heuristic
approximation algorithms
optimal solution
temporal logic
greedy heuristics
dynamic programming
computational complexity
network flow
solution space
np complete
manufacturing systems
integer programming
particle swarm optimization