V. Madan

activity

20122022

most citedImproving Early Sepsis Prediction with Multi Modal Learning

6 citations · 9 across the 5 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2016

Approximating Multicut and the Demand Graph

Chandra Chekuri, Vivek Madan

In the minimum Multicut problem, the input is an edge-weighted supply graph $G = (V, E)$ and a simple demand graph $H = (V, F)$ . Either $G$ and $H$ are directed (DMulC) or both are undir…

cs.DM2013

On the Expansion of Group-Based Lifts

Naman Agarwal, Karthekeyan Chandrasekaran, Alexandra Kolla +1

A $k$ -lift of an $n$ -vertex base graph $G$ is a graph $H$ on $n \times k$ vertices, where each vertex $v$ of $G$ is replaced by $k$ vertices $v_{1}, \dots, v_{k}$ and each edge $(u, v)$ …