80 citations · 273 across the 37 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.DS2006
The Common Prefix Problem On Trees
Sreyash Kenkre, Sundar Vishwanathan
We present a theoretical study of a problem arising in database query optimization, which we call as The Common Prefix Problem. We present a factor approximation algorit…
cs.CC2006
Approximation Algorithms for the Bipartite Multi-cut Problem
Sreyash Kenkre, Sundar Vishwanathan
We introduce the {\it Bipartite Multi-cut} problem. This is a generalization of the {\it st-Min-cut} problem, is similar to the {\it Multi-cut} problem (except for more stringent r…