5 citations · 14 across the 10 of their papers we have counts for
12 papers
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…
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…
Improved Approximation for Weighted Tree Augmentation with Bounded Costs
David Adjiashvili
The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in the field of network design. Given an undirected tree , an additional set of edges $…
Firefighting on Trees Beyond Integrality Gaps
David Adjiashvili, Andrea Baggio, Rico Zenklusen
The Firefighter problem and a variant of it, known as Resource Minimization for Fire Containment (RMFC), are natural models for optimal inhibition of harmful spreading processes. D…
Model-Driven Automatic Tiling with Cache Associativity Lattices
David Adjiashvili, Utz-Uwe Haus, Adrian Tate
Traditional compiler optimization theory distinguishes three separate classes of cache miss -- Cold, Conflict and Capacity. Tiling for cache is typically guided by capacity miss co…
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…
Labeling Schemes for Bounded Degree Graphs
David Adjiashvili, Noy Rotbart
We investigate adjacency labeling schemes for graphs of bounded degree . In particular, we present an optimal (up to an additive constant) adjacency labeli…
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…
The Online Replacement Path Problem
David Adjiashvili, Marco Senatore
We study a natural online variant of the replacement path problem. The \textit{replacement path problem} asks to find for a given graph , two designated vertices $s,t\in…