Julia Chuzhoy

most citedAn

O (k^{3} l o g n)

-Approximation Algorithm for Vertex-Connectivity Survivable Network Design

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2009

On Allocating Goods to Maximize Fairness

Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna

Given a set of $m$ agents and a set of $n$ items, where agent $A$ has utility $u_{A, i}$ for item $i$ , our goal is to allocate items to agents to maximize fairness. Specifically, th…

cs.DS2008★ 1 cited

An $O (k^{3} l o g n)$ -Approximation Algorithm for Vertex-Connectivity Survivable Network Design

Julia Chuzhoy, Sanjeev Khanna

In the Survivable Network Design problem (SNDP), we are given an undirected graph $G (V, E)$ with costs on edges, along with a connectivity requirement $r (u, v)$ for each pair $u, v$ o…

On Allocating Goods to Maximize Fairness

An O(k3logn)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design

An $O (k^{3} l o g n)$ -Approximation Algorithm for Vertex-Connectivity Survivable Network Design