5 citations · 13 across the 5 of their papers we have counts for
5 papers · 1 filter
Fault-Tolerant Edge-Disjoint Paths -- Beyond Uniform Faults
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler +1
The overwhelming majority of survivable (fault-tolerant) network design models assume a uniform fault model. Such a model assumes that every subset of the network resources (edges…
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity
David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
Graph connectivity and network design problems are among the most fundamental problems in combinatorial optimization. The minimum spanning tree problem, the two edge-connected span…
Robust Assignments with Vulnerable Nodes
David Adjiashvili, Viktor Bindewald, Dennis Michaels
Various real-life planning problems require making upfront decisions before all parameters of the problem have been disclosed. An important special case of such problem especially…
Robust Assignments via Ear Decompositions and Randomized Rounding
David Adjiashvili, Viktor Bindewald, Dennis Michaels
Many real-life planning problems require making a priori decisions before all parameters of the problem have been revealed. An important special case of such problem arises in sche…
Fault-Tolerant Shortest Paths - Beyond the Uniform Failure Model
David Adjiashvili
The overwhelming majority of survivable (fault-tolerant) network design models assume a uniform scenario set. Such a scenario set assumes that every subset of the network resources…