Approximation and hardness results for Robust Network design with Exponential Scenarios

Abstract

In a classical optimization problem, we are usually given a system with some known parameters and constraints and the goal is to find a feasible solution of minimum cost (or maximum profit) with respect to the constraints. Often these parameters and constraints, which heavily influence the optimum solution, are assumed to be precisely known. For example, we… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics