K. Chandrasekaran

activity

20092026

most citedThe Cutting Plane Method is Polynomial for Perfect Matchings

7 citations · 29 across the 31 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.DS2022

Approximate minimum cuts and their enumeration

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We show that every $α$ -approximate minimum cut in a connected graph is the unique minimum $(S, T)$ -terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloo…

cs.DS2022

Counting and enumerating optimum cut sets for hypergraph $k$ -partitioning problems for fixed $k$

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We consider the problem of enumerating optimal solutions for two hypergraph $k$ -partitioning problems -- namely, Hypergraph- $k$ -Cut and Minmax-Hypergraph- $k$ -Partition. The input i…

Approximate minimum cuts and their enumeration

Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k

Counting and enumerating optimum cut sets for hypergraph $k$ -partitioning problems for fixed $k$