7 citations · 29 across the 31 of their papers we have counts for
43 papers · 1 filter
Improved Lower Bound for Steiner Point Removal
Karthekeyan Chandrasekaran, Chandra Chekuri, Qingyun Chen +1
In the Steiner Point Removal problem, we are given a graph with an edge-length function and a subset of terminals. The…
A -approximation for -Flexible Graph Connectivity
Karthekeyan Chandrasekaran, Raymond Jiang, Krishna Kalathur
In the -Flexible Graph Connectivity problem, the input consists of non-negative integers and and a graph whose edges are classified into safe and unsafe e…
A Polymatroidal Perspective on Random Contraction
Karthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu
Karger's elegant random contraction algorithm for finding a global mincut in a graph has been highly influential. More recent work has obtained several different (nonuniform) rando…
An iterative rounding -approximation for Feedback Vertex Set via AI-assisted proof of an extreme point property
Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni
We consider the Feedback Vertex Set problem (FVS): the input is an undirected graph and the goal is to find a minimum-cardinality (or a min-cost in the weighted case) sub…
Multiobjective Hypergraph Min-Cut in Quasi-Polynomial Time
Karthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu
We study the multiobjective hypergraph min-cut problem: Given a hypergraph and cost functions , the goal is to find a no…
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…