5 citations · 10 across the 3 of their papers we have counts for
3 papers
cs.DS2019
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
Chandra Chekuri, Alina Ene, Ali Vakilian
We consider node-weighted survivable network design (SNDP) in planar graphs and minor-closed families of graphs. The input consists of a node-weighted undirected graph an…
cs.DS2011★ 5 cited
Approximation Algorithms for Submodular Multiway Partition
Chandra Chekuri, Alina Ene
We study algorithms for the Submodular Multiway Partition problem (SubMP). An instance of SubMP consists of a finite ground set , a subset of elements $S = \{s_1,s_2,...,s_k…
cs.DS2011★ 5 cited
Submodular Cost Allocation Problem and Applications
Chandra Chekuri, Alina Ene
We study the Minimum Submodular-Cost Allocation problem (MSCA). In this problem we are given a finite ground set and non-negative submodular set functions o…