activity
20132021
most citedRobust Assignments via Ear Decompositions and Randomized Rounding

5 citations · 13 across the 5 of their papers we have counts for

collaborators

7 papers

math.OC2021

An Optimization Framework for Power Infrastructure Planning

Nina Wiedemann, David Adjiashvili

The ubiquitous expansion and transformation of the energy supply system involves large-scale power infrastructure construction projects. In the view of investments of more than a m…

cs.DS2020

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…

cs.DS20191 cited

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…

cs.DS20173 cited

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…

cs.DS20165 cited

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…

math.OC2015

Non-Uniform Robust Network Design in Planar Graphs

David Adjiashvili

Robust optimization is concerned with constructing solutions that remain feasible also when a limited number of resources is removed from the solution. Most studies of robust combi…