Nearly Optimal NP-Hardness of Unique Coverage.

Venkatesan Guruswami Euiwoong Lee

Published in: SODA (2016)

Keyphrases

np hardness
worst case analysis
np hard
approximation algorithms
optimal solution
dynamic programming
scheduling problem
worst case
multi dimensional