22 citations · 38 across the 14 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
Samir Khuller, Manish Purohit, Kanthi Sarpatwar
We study partial and budgeted versions of the well studied connected dominating set problem. In the partial connected dominating set problem, we are given an undirected graph G = (…
cs.GT2013★ 1 cited
Improved algorithms and analysis for the laminar matroid secretary problem
David Harris, Manish Purohit
In a matroid secretary problem, one is presented with a sequence of objects of various weights in a random order, and must choose irrevocably to accept or reject each item. There i…