Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

* | 2009 | |
---|---|---|

35 | EE | Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko: On Hardness of Pricing Items for Single-Minded Bidders. APPROX-RANDOM 2009: 202-216 |

34 | EE | Rahul Garg, Rohit Khandekar: Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property. ICML 2009: 43 |

33 | EE | Baruch Awerbuch, Zhenghua Fu, Rohit Khandekar: Brief announcement: Stateless distributed algorithms for generalized packing linear programs. PODC 2009: 270-271 |

32 | EE | Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour: A logarithmic approximation for unsplittable flow on line graphs. SODA 2009: 702-709 |

31 | EE | Baruch Awerbuch, Rohit Khandekar: Greedy distributed optimization of multi-commodity flows. Distributed Computing 21(5): 317-329 (2009) |

30 | EE | Rohit Khandekar, Satish Rao, Umesh V. Vazirani: Graph partitioning using single commodity flows. J. ACM 56(4): (2009) |

29 | EE | Baruch Awerbuch, Rohit Khandekar: Stateless Distributed Gradient Descent for Positive Linear Programs. SIAM J. Comput. 38(6): 2468-2486 (2009) |

2008 | ||

28 | EE | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour: Two-Stage Robust Network Design with Exponential Scenarios. ESA 2008: 589-600 |

27 | EE | Baruch Awerbuch, Rohit Khandekar: Stateless Near Optimal Flow Control with Poly-logarithmic Convergence. LATIN 2008: 580-592 |

26 | EE | Baruch Awerbuch, Rohit Khandekar: Greedy distributed optimization of unsplittable multicommodity flows. PODC 2008: 439 |

25 | EE | Baruch Awerbuch, Rohit Khandekar: Stateless distributed algorithms for near optimal maximum multicommodity flows. PODC 2008: 440 |

24 | EE | Baruch Awerbuch, Yossi Azar, Rohit Khandekar: Fast load balancing via bounded best response. SODA 2008: 314-322 |

23 | EE | Baruch Awerbuch, Rohit Khandekar: Cost sharing mechanisms for near-optimal traffic aggregation and network design. SPAA 2008: 85-90 |

22 | EE | Baruch Awerbuch, Rohit Khandekar: Stateless distributed gradient descent for positive linear programs. STOC 2008: 691-700 |

21 | EE | Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan: Additive guarantees for degree bounded directed network design. STOC 2008: 769-778 |

20 | EE | Lisa Fleischer, Rahul Garg, Sanjiv Kapoor, Rohit Khandekar, Amin Saberi: A Fast and Simple Algorithm for Computing Market Equilibria. WINE 2008: 19-30 |

19 | EE | Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann: On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4): 399-401 (2008) |

2007 | ||

18 | EE | Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber: Non-Preemptive Min-Sum Scheduling with Resource Augmentation. FOCS 2007: 614-624 |

17 | EE | Baruch Awerbuch, Rohit Khandekar: Greedy distributed optimization of multi-commodity flows. PODC 2007: 274-283 |

16 | EE | Baruch Awerbuch, Rohit Khandekar: Distributed network monitoring and multicommodity flows: a primal-dual approach. PODC 2007: 284-291 |

15 | EE | Baruch Awerbuch, Rohit Khandekar: Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach. PODC 2007: 354-355 |

14 | EE | Baruch Awerbuch, Rohit Khandekar: On cost sharing mechanisms in the network design game. PODC 2007: 364-365 |

13 | EE | Baruch Awerbuch, Rohit Khandekar, Satish Rao: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. SODA 2007: 949-957 |

2006 | ||

12 | EE | Rohit Khandekar, Vinayaka Pandit: Offline Sorting Buffers on Line. ISAAC 2006: 81-89 |

11 | EE | Rohit Khandekar, Vinayaka Pandit: Online Sorting Buffers on Line. STACS 2006: 584-595 |

10 | EE | Rohit Khandekar, Satish Rao, Umesh V. Vazirani: Graph partitioning using single commodity flows. STOC 2006: 385-390 |

2005 | ||

9 | EE | Naveen Garg, Rohit Khandekar, Vinayaka Pandit: Improved approximation for universal facility location. SODA 2005: 959-960 |

8 | EE | 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. WINE 2005: 1046-1055 |

2004 | ||

7 | EE | Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra: An Efficient Central Path Algorithm for Virtual Navigation. Computer Graphics International 2004: 188-195 |

6 | EE | Naveen Garg, Rohit Khandekar: Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries. ESA 2004: 371-382 |

5 | EE | Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit: Local Search Heuristics for k-Median and Facility Location Problems. SIAM J. Comput. 33(3): 544-562 (2004) |

2003 | ||

4 | EE | Naveen Garg, Rohit Khandekar, Keshav Kunal, Vinayaka Pandit: Bandwidth Maximization in Multicasting. ESA 2003: 242-253 |

2002 | ||

3 | EE | Naveen Garg, Rohit Khandekar: Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. FOCS 2002: 500- |

2001 | ||

2 | EE | 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. IPCO 2001: 170-184 |

1 | EE | Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit: Local search heuristic for k-median and facility location problems. STOC 2001: 21-29 |