Approximating optimization problems in graphs with locational uncertainty

Marin Bougeret, Jérémy Omer, Michael Poss

Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the ve…