5 papers
Hypernyms Through Intra-Article Organization in Wikipedia
Disha Shrivastava, Sreyash Kenkre, Santosh Penubothula
We introduce a new measure for unsupervised hypernym detection and directionality. The motivation is to keep the measure computationally light and portatable across languages. We s…
On the Approximability of Digraph Ordering
Sreyash Kenkre, Vinayaka Pandit, Manish Purohit +1
Given an n-vertex digraph D = (V, A) the Max-k-Ordering problem is to compute a labeling maximizing the number of forward edges, i.e. edges (u,v) such that $\ell…
Circumference, Chromatic Number and Online Coloring
Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan
Erdös conjectured that if is a triangle free graph of chromatic number at least , then it contains an odd cycle of length at least \cite{sudakovverstraete…
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…
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…