The Survivable Network Design problem (SNDP) is a well-studied problem, motivated by the
design of networks that are robust to faults under the assumption that any subset of edges …

We consider the approximability of center-based clustering problems where the points to be
clustered lie in a metric space, and no candidate centers are specified. We call such …

We introduce and study the problem Flexible Graph Connectivity, which in contrast to many
classical connectivity problems features a non-uniform failure model. We distinguish …

We present approximation algorithms for several network design problems in the model of
flexible graph connectivity (Adjiashvili et al., in: IPCO, pp 13–26, 2020, Math Program 1–33 …

We address long-standing open questions raised by Williamson, Goemans, Vazirani and
Mihail pertaining to the design of approximation algorithms for problems in network design …

We propose a new mathematical model for transport optimization in logistics networks on
the tactical level. The main features include accurately modeled tariff structures and the …

Motivated by current trends in cloud computing, we study a version of the generalized
assignment problem where a set of virtual processors has to be implemented by a set of …

Adjiashvili introduced network design in a non-uniform fault model: the edge set of a given
graph is partitioned into safe and unsafe edges. A vertex pair $(s, t) $ is $(p, q) $-flex …

Abstract In the Non-Uniform k-Center problem we need to cover a finite metric space using k
balls of different radii that can be scaled uniformly. The goal is to minimize the scaling factor …

In the non-uniform k-center problem, the objective is to cover points in a metric space with
specified number of balls of different radii. Chakrabarty, Goyal, and Krishnaswamy [ICALP …