Sharat Ibrahimpur

activity

20172026

most citedA

4/3

-Approximation Algorithm for the Minimum

2

-Edge Connected Multisubgraph Problem in the Half-Integral Case

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

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2025

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding

Sharat Ibrahimpur, László A. Végh

In the Flexible Graph Connectivity (FGC) problem, we are given an undirected multigraph on $n$ vertices with nonnegative edge costs, where each edge is classified as either safe or…

cs.DM2017

Min-Max Theorems for Packing and Covering Odd $(u, v)$ -trails

Sharat Ibrahimpur, Chaitanya Swamy

We investigate the problem of packing and covering odd $(u, v)$ -trails in a graph. A $(u, v)$ -trail is a $(u, v)$ -walk that is allowed to have repeated vertices but no repeated edges.…

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding

Min-Max Theorems for Packing and Covering Odd (u,v)-trails

Min-Max Theorems for Packing and Covering Odd $(u, v)$ -trails