9 citations · 19 across the 3 of their papers we have counts for
3 papers
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…
cs.DS2010★ 9 cited
Prize-Collecting Steiner Tree and Forest in Planar Graphs
Chandra Chekuri, Alina Ene, Nitish Korula
We obtain polynomial-time approximation-preserving reductions (up to a factor of 1 + ε) from the prize-collecting Steiner tree and prize-collecting Steiner forest problems in plana…