Independent sets and vertex covers considered within the context of robust optimization
Abstract
This paper studies robust variants of the maximum weighted independent set problem and the minimum weighted vertex cover problem, respectively. Both problems are posed in a vertex-weighted graph. The paper explores whether the complement of a robustly optimal independent set must be a robustly optimal vertex cover, and vice-versa.
Keywords
weighted graph; independent set; vertex cover; robust optimization
Full Text:
PDFISSN: 1331-0623 (Print), 1848-8013 (Online)