The SCEAS System
| |||||||

## Search the dblp DataBase
Rohit Khandekar:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra
**An Efficient Central Path Algorithm for Virtual Navigation.**[Citation Graph (0, 0)][DBLP] Computer Graphics International, 2004, pp:188-195 [Conf] - Naveen Garg, Rohit Khandekar
**Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries.**[Citation Graph (0, 0)][DBLP] ESA, 2004, pp:371-382 [Conf] - Naveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit
**Bandwidth Maximization in Multicasting.**[Citation Graph (0, 0)][DBLP] ESA, 2003, pp:242-253 [Conf] - Naveen Garg, Rohit Khandekar
**Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:500-0 [Conf] - Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II
**On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.**[Citation Graph (0, 0)][DBLP] IPCO, 2001, pp:170-184 [Conf] - Rohit Khandekar, Vinayaka Pandit
**Offline Sorting Buffers on Line.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:81-89 [Conf] - Naveen Garg, Rohit Khandekar, Vinayaka Pandit
**Improved approximation for universal facility location.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:959-960 [Conf] - Rohit Khandekar, Vinayaka Pandit
**Online Sorting Buffers on Line.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:584-595 [Conf] - Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit
**Local search heuristic for k-median and facility location problems.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:21-29 [Conf] - Rohit Khandekar, Satish Rao, Umesh V. Vazirani
**Graph partitioning using single commodity flows.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:385-390 [Conf] - Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, Vinayaka Pandit, Amin Saberi, Vijay V. Vazirani
**Price of Anarchy, Locality Gap, and a Network Service Provider Game.**[Citation Graph (0, 0)][DBLP] WINE, 2005, pp:1046-1055 [Conf] - Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit
**Local Search Heuristics for k-Median and Facility Location Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:3, pp:544-562 [Journal] - Baruch Awerbuch, Rohit Khandekar
**On cost sharing mechanisms in the network design game.**[Citation Graph (0, 0)][DBLP] PODC, 2007, pp:364-365 [Conf] - Baruch Awerbuch, Rohit Khandekar
**Greedy distributed optimization of multi-commodity flows.**[Citation Graph (0, 0)][DBLP] PODC, 2007, pp:274-283 [Conf] - Baruch Awerbuch, Rohit Khandekar
**Distributed network monitoring and multicommodity flows: a primal-dual approach.**[Citation Graph (0, 0)][DBLP] PODC, 2007, pp:284-291 [Conf] - Baruch Awerbuch, Rohit Khandekar
**Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach.**[Citation Graph (0, 0)][DBLP] PODC, 2007, pp:354-355 [Conf] - Baruch Awerbuch, Rohit Khandekar, Satish Rao
**Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:949-957 [Conf] **On Hardness of Pricing Items for Single-Minded Bidders.**[Citation Graph (, )][DBLP]**The Checkpoint Problem.**[Citation Graph (, )][DBLP]**Two-Stage Robust Network Design with Exponential Scenarios.**[Citation Graph (, )][DBLP]**Budgeted Red-Blue Median and Its Generalizations.**[Citation Graph (, )][DBLP]**Non-Preemptive Min-Sum Scheduling with Resource Augmentation.**[Citation Graph (, )][DBLP]**Bounded Size Graph Clustering with Applications to Stream Processing.**[Citation Graph (, )][DBLP]**Approximating Fault-Tolerant Group-Steiner Problems.**[Citation Graph (, )][DBLP]**Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property.**[Citation Graph (, )][DBLP]**Prize-Collecting Steiner Network Problems.**[Citation Graph (, )][DBLP]**On Generalizations of Network Design Problems with Degree Bounds.**[Citation Graph (, )][DBLP]**Stateless Near Optimal Flow Control with Poly-logarithmic Convergence.**[Citation Graph (, )][DBLP]**COLA: Optimizing Stream Processing Applications via Graph Partitioning.**[Citation Graph (, )][DBLP]**Greedy distributed optimization of unsplittable multicommodity flows.**[Citation Graph (, )][DBLP]**Stateless distributed algorithms for near optimal maximum multicommodity flows.**[Citation Graph (, )][DBLP]**Brief announcement: Stateless distributed algorithms for generalized packing linear programs.**[Citation Graph (, )][DBLP]**Fast load balancing via bounded best response.**[Citation Graph (, )][DBLP]**A logarithmic approximation for unsplittable flow on line graphs.**[Citation Graph (, )][DBLP]**Cost sharing mechanisms for near-optimal traffic aggregation and network design.**[Citation Graph (, )][DBLP]**Additive guarantees for degree bounded directed network design.**[Citation Graph (, )][DBLP]**Stateless distributed gradient descent for positive linear programs.**[Citation Graph (, )][DBLP]**A Fast and Simple Algorithm for Computing Market Equilibria.**[Citation Graph (, )][DBLP]**On Generalizations of Network Design Problems with Degree Bounds**[Citation Graph (, )][DBLP]**Greedy distributed optimization of multi-commodity flows.**[Citation Graph (, )][DBLP]
Search in 0.028secs, Finished in 0.030secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |