Complexity of the robust weighted independent set problems on interval graphs.

Adam Kasperski Pawel Zielinski

Published in: Optim. Lett. (2015)

Keyphrases

independent set
maximum independent set
optimization problems
np complete
graph theory
maximum weight
graph theoretic
computational complexity
multi dimensional
random walk
decision problems
robust optimization
polynomial time complexity