Raymond Jiang

collaborators

2 papers

cs.DS2026

A $(p + q)^{O (pq)}$ -approximation for $(p, q)$ -Flexible Graph Connectivity

Karthekeyan Chandrasekaran, Raymond Jiang, Krishna Kalathur

In the $(p, q)$ -Flexible Graph Connectivity problem, the input consists of non-negative integers $p$ and $q$ and a graph $G = (V, E)$ whose edges are classified into safe and unsafe e…

cs.DS2026

Multi-tier Flexible Graph Connectivity

Karthekeyan Chandrasekaran, Raymond Jiang, Krishna Kalathur

Motivated by non-uniform edge failures in network design, we introduce a multi-tier model of flexible graph connectivity. In k-tier Flexible Graph Connectivity (k-tier FGC), the in…

A (p+q)O(pq)-approximation for (p,q)-Flexible Graph Connectivity

Multi-tier Flexible Graph Connectivity

A $(p + q)^{O (pq)}$ -approximation for $(p, q)$ -Flexible Graph Connectivity