2 papers
cs.DS2022
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…
cs.DS2021
Optimization problems in graphs with locational uncertainty
Marin Bougeret, Jérémy Omer, Michael Poss
Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the…