C. Swamy

collaborators

4 papers

cs.DS2025

Unsplittable Cost Flows from Unweighted Error-Bounded Variants

Chaitanya Swamy, Vera Traub, Laura Vargas Koch +1

A famous conjecture of Goemans on single-source unsplittable flows states that one can turn any fractional flow into an unsplittable one of no higher cost, while increasing the loa…

cs.DS2025

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique

Nikhil Kumar, JJ Nan, Chaitanya Swamy

In the classical \emph{survivable-network-design problem} (SNDP), we are given an undirected graph $G = (V, E)$ , non-negative edge costs, and some $(s_{i}, t_{i}, r_{i})$ tuples, where $s_…

cs.DS2025

Almost Tight Additive Guarantees for $k$ -Edge-Connectivity

Nikhil Kumar, Chaitanya Swamy

We consider the \emph{ $k$ -edge connected spanning subgraph} (kECSS) problem, where we are given an undirected graph $G = (V, E)$ with nonnegative edge costs ${c_{e}}_{e \in E}$ , and…

cs.GT2025

Constant-Factor Distortion Mechanisms for $k$ -Committee Election

Haripriya Pulyassary, Chaitanya Swamy

In the $k$ -committee election problem, we wish to aggregate the preferences of $n$ agents over a set of alternatives and select a committee of $k$ alternatives that minimizes the c…

Unsplittable Cost Flows from Unweighted Error-Bounded Variants

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique

Almost Tight Additive Guarantees for k-Edge-Connectivity

Constant-Factor Distortion Mechanisms for k-Committee Election

Almost Tight Additive Guarantees for $k$ -Edge-Connectivity

Constant-Factor Distortion Mechanisms for $k$ -Committee Election