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

Adam Kasperski Pawel Zielinski

Published in: CoRR (2014)

Keyphrases

independent set
maximum independent set
decision problems
graph theoretic
polynomial time complexity
multi dimensional
maximum weight
np complete
graph matching
robust optimization