6 citations · 6 across the 2 of their papers we have counts for
4 papers · 1 filter
Maximizing Determinants under Matroid Constraints
Vivek Madan, Aleksandar Nikolov, Mohit Singh +1
Given vectors and a matroid , we study the problem of finding a basis of such that is maximized…
Improving the Integrality Gap for Multiway Cut
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király +1
In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of terminal nodes, and the goal is to partition the node set of th…
Spectrally Robust Graph Isomorphism
Alexandra Kolla, Ioannis Koutis, Vivek Madan +1
We initiate the study of spectral generalizations of the graph isomorphism problem. (a)The Spectral Graph Dominance (SGD) problem: On input of two graphs and does there exi…
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
Chandra Chekuri, Vivek Madan
In Directed Multiway Cut(Dir-MC) the input is an edge-weighted directed graph and a set of terminal nodes ; the goal is to find a…