Searching for authors named "Chandra Chekuri" – sorted by Relevance.
-
On average throughput and alphabet size in network coding. Accepted to
- On Average Throughput and Alphabet Size in Network Coding Chandra Chekuri Bell Labs, Lucent Murray
- Cited by 5 (2 self) – Add To MetaCart
-
Approximation Algorithms For Scheduling Problems
- of the requirements for the degree of doctor of philosophy By Chandra Chekuri August 1998 c fl Copyright 1998
- Cited by 5 (0 self) – Add To MetaCart
-
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
- Chandra Chekuri y Michael Bender z July 4, 1999 Abstract We give a new efficient approximation
- Cited by 17 (3 self) – Add To MetaCart
-
Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine
- Chandra Chekuri Rajeev Motwani y Abstract We consider the problem of scheduling a set of jobs on a
- Cited by 12 (0 self) – Add To MetaCart
-
Min-Cost 2-Connected Subgraphs With k Terminals
- arXiv:0802.2528v1 [cs.DS] 18 Feb 2008 Min-Cost 2-Connected Subgraphs With k Terminals Chandra
- Add To MetaCart
-
Conjunctive Query Containment Revisited
- Conjunctive Query Containment Revisited Chandra Chekuri y Anand Rajaraman z November 13, 1998
- Cited by 76 (0 self) – Add To MetaCart
-
Approximation Schemes for Preemptive Weighted Flow Time
- Approximation Schemes for Preemptive Weighted Flow Time Chandra Chekuri Sanjeev Khanna y
- Cited by 13 (2 self) – Add To MetaCart
-
Covering by translated intervals is NP-Hard
- Covering by translated intervals is NP-Hard Chandra Chekuri ∗ Sariel Har-Peled † July 25, 2006
- Add To MetaCart
-
Incremental Clustering and Dynamic Information Retrieval
- Incremental Clustering and Dynamic Information Retrieval MOSES CHARIKAR CHANDRA CHEKURI y TOM
- Cited by 111 (3 self) – Add To MetaCart
-
On Multi-dimensional Packing Problems
- On Multi-dimensional Packing Problems Chandra Chekuri Sanjeev Khanna y Abstract We study
- Cited by 35 (2 self) – Add To MetaCart

