34 citations · 112 across the 16 of their papers we have counts for
7 papers · 1 filter
Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings
Shashwat Banchhor, Rishikesh Gajjala, Yogish Sabharwal +1
In this paper, we study the problem of designing prefix-free encoding schemes having minimum average code length that can be decoded efficiently under a decode cost model that capt…
Replica Placement on Bounded Treewidth Graphs
Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta +3
We consider the replica placement problem: given a graph with clients and nodes, place replicas on a minimum set of nodes to serve all the clients; each client is associated with a…
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…