Amit Chakrabarti

Publications
Influence

Submodular Maximization Meets Streaming: Matchings, Matroids, and More

Amit Chakrabarti, Sagar Kale
Mathematics, Computer Science
IPCO
8 September 2013

We study the problem of finding a maximum matching in a graph given by an input stream listing its edges in some arbitrary order, where the quantity to be maximized is given by a monotone submodular function on subsets of edges. Expand

Near-optimal lower bounds on the multi-party communication complexity of set disjointness

Amit Chakrabarti, S. Khot, X. Sun
Mathematics, Computer Science
18th IEEE Annual Conference on Computational…
7 July 2003

We study the communication complexity of the set disjointness problem in the general multiparty model and the one-way communication model. Expand

Improved Approximation Algorithms for Resource Allocation

G. Calinescu, Amit Chakrabarti, H. Karloff, Y. Rabani
Computer Science
IPCO
27 May 2002

We study the problem of finding a most profitable subset of n given tasks, each with a given start and finish time as well as profit and resource requirement, that at no time exceeds the quantity B of available resource. We show that this NP-hard Resource Allocation problem can be (1/2-?)-approximated in polynomial time. Expand

A quasi-PTAS for unsplittable flow on line graphs

N. Bansal, Amit Chakrabarti, A. Epstein, B. Schieber
Computer Science, Mathematics
STOC '06
21 May 2006

We study the Unsplittable Flow Problem (UFP) on line graphs and cycles, focusing on the long-standing open question of whether the problem is APX-hard. Expand

An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

Amit Chakrabarti, O. Regev
Mathematics, Computer Science
SIAM J. Comput.
17 September 2010

We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied gap-hamming-distance problem. Expand

Approximation Algorithms for the Unsplittable Flow Problem

Amit Chakrabarti, C. Chekuri, A. Gupta, A. Kumar
Mathematics, Computer Science
Algorithmica
2006

We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs in which the edge capacities can vary arbitrarily over the graph. Expand

Informational complexity and the direct sum problem for simultaneous message complexity

Amit Chakrabarti, Y. Shi, A. Wirth, A. Yao
Mathematics, Computer Science
Proceedings IEEE International Conference on…
14 October 2001

We introduce a new notion of informational complexity which is related to SM complexity and has nice direct sum properties in the simultaneous message (SM) model. Expand

A near-optimal algorithm for computing the entropy of a stream

Amit Chakrabarti, Graham Cormode, A. Mcgregor
Mathematics, Computer Science
SODA '07
7 January 2007

We describe a simple algorithm for approximating the empirical entropy of a stream of m values in a single pass, using a space lower bound of Ω(ε-2 log(Δ-1) words of space. Expand

Functional Monitoring without Monotonicity

Chrisil Arackaparambil, J. Brody, Amit Chakrabarti
Computer Science, Mathematics
ICALP
6 July 2009

The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi to initiate a formal study of the communication cost of certain fundamental problems arising in distributed systems. Expand

An optimal randomised cell probe lower bound for approximate nearest neighbour searching

Amit Chakrabarti, O. Regev
Mathematics, Computer Science
45th Annual IEEE Symposium on Foundations of…
17 October 2004

We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1 }/sup d/. Expand

Recommended Authors