7 citations · 14 across the 8 of their papers we have counts for
6 papers · 1 filter
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers
Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury +2
In this paper, we study a class of set cover problems that satisfy a special property which we call the {\em small neighborhood cover} property. This class encompasses several well…
Scheduling Resources for Executing a Partial Set of Jobs
Venkatesan Chakaravarthy, Arindam Pal, Sambuddha Roy +1
In this paper, we consider the problem of choosing a minimum cost set of resources for executing a specified set of jobs. Each input job is an interval, determined by its start-tim…
Density Functions subject to a Co-Matroid Constraint
Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan +2
In this paper we consider the problem of finding the {\em densest} subset subject to {\em co-matroid constraints}. We are given a {\em monotone supermodular} set function defin…
Distributed Algorithms for Scheduling on Line and Tree Networks
Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal
We have a set of processors (or agents) and a set of graph networks defined over some vertex set. Each processor can access a subset of the graph networks. Each processor has a dem…
Approximation Algorithms for Edge Partitioned Vertex Cover Problems
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar +1
We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a positive cost function c: V-> Z^{+}, a partition $P_1,..…
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
Samir Datta, Raghav Kulkarni, Sambuddha Roy
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati…