Approximation algorithms for network design in non-uniform fault models
C Chekuri, R Jain - arXiv preprint arXiv:2403.15547, 2024 - arxiv.org
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 …
design of networks that are robust to faults under the assumption that any subset of edges …
Approximation algorithms for continuous clustering and facility location problems
D Chakrabarty, M Negahbani, A Sarkar - arXiv preprint arXiv:2206.15105, 2022 - arxiv.org
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 …
clustered lie in a metric space, and no candidate centers are specified. We call such …
Flexible Graph Connectivity: Approximating network design problems between 1-and 2-connectivity
D Adjiashvili, F Hommelsheim… - Mathematical Programming, 2022 - Springer
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 …
classical connectivity problems features a non-uniform failure model. We distinguish …
Approximation algorithms for flexible graph connectivity
S Boyd, J Cheriyan, A Haddadan… - Mathematical Programming, 2024 - Springer
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 …
flexible graph connectivity (Adjiashvili et al., in: IPCO, pp 13–26, 2020, Math Program 1–33 …
Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
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 …
Mihail pertaining to the design of approximation algorithms for problems in network design …
An integrated approach to tactical transportation planning in logistics networks
T Harks, FG König, J Matuschke… - Transportation …, 2016 - pubsonline.informs.org
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 …
the tactical level. The main features include accurately modeled tariff structures and the …
Power-efficient assignment of virtual machines to physical machines
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 …
assignment problem where a set of virtual processors has to be implemented by a set of …
Augmentation based approximation algorithms for flexible network design
C Chekuri, R Jain - arXiv preprint arXiv:2209.12273, 2022 - arxiv.org
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 …
graph is partitioned into safe and unsafe edges. A vertex pair $(s, t) $ is $(p, q) $-flex …
Towards Non-Uniform k-Center with Constant Types of Radii
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 …
balls of different radii that can be scaled uniformly. The goal is to minimize the scaling factor …
Robust k-center with two types of radii
D Chakrabarty, M Negahbani - Mathematical Programming, 2023 - Springer
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 …
specified number of balls of different radii. Chakrabarty, Goyal, and Krishnaswamy [ICALP …