Rohit Khandekar

Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour: Two-stage Robust Network Design with Exponential Scenarios. Algorithmica 65(2): 391-408 (2013)

Rohit Khandekar, Guy Kortsarz, Zeev Nutov: On some network design problems with degree constraints. J. Comput. Syst. Sci. 79(5): 725-736 (2013)

Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir: All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO 2013: 13-24

MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz: Local Search Algorithms for the Red-Blue Median Problem. Algorithmica 63(4): 795-814 (2012)

Joel L. Wolf, Andrey Balmin, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Sujay Parekh, Kun-Lung Wu, Rares Vernica: CIRCUMFLEX: a scheduling optimizer for MapReduce workloads with shared scans. Operating Systems Review 46(1): 26-32 (2012)

Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Prize-collecting steiner network problems. ACM Transactions on Algorithms 9(1): 2 (2012)

Baruch Awerbuch, Rohit Khandekar, Satish Rao: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. ACM Transactions on Algorithms 9(1): 3 (2012)

Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Approximating fault-tolerant group-Steiner problems. Theor. Comput. Sci. 416: 55-64 (2012)

MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre: The checkpoint problem. Theor. Comput. Sci. 452: 88-99 (2012)

Joel L. Wolf, Andrey Balmin, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Sujay Parekh, Kun-Lung Wu, Rares Vernica: On the optimization of schedules for MapReduce workloads in the presence of shared scans. VLDB J. 21(5): 589-609 (2012)

Rohit Khandekar, Kirsten Hildrum, Deepak Rajan, Joel L. Wolf: Scheduling with Setup Costs and Monotone Penalties. FSTTCS 2012: 185-198

Ahmed Eldawy, Rohit Khandekar, Kun-Lung Wu: Clustering Streaming Graphs. ICDCS 2012: 466-475

Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni: Advantage of Overlapping Clusters for Minimizing Conductance. LATIN 2012: 494-505

Rahul Garg, Rohit Khandekar: Block-sparse Solutions using Kernel Block RIP and its Application to Group Lasso. Journal of Machine Learning Research - Proceedings Track 15: 296-304 (2011)

Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Network-Design with Degree Constraints. APPROX-RANDOM 2011: 289-301

MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Vahid Liaghat: On a local protocol for concurrent file transfers. SPAA 2011: 269-278

MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Combinatorial Algorithms for Capacitated Network Design. CoRR abs/1108.1176 (2011)

Rohit Khandekar, Vinayaka Pandit: Online and offline algorithms for the sorting buffers problem on the line metric. J. Discrete Algorithms 8(1): 24-35 (2010)

MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre: The Checkpoint Problem. APPROX-RANDOM 2010: 219-231

MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz: Budgeted Red-Blue Median and Its Generalizations. ESA (1) 2010: 314-325

Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir: Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS 2010: 169-180

MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Prize-Collecting Steiner Network Problems. IPCO 2010: 71-84

Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123

Joel L. Wolf, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Vibhore Kumar, Sujay Parekh, Kun-Lung Wu, Andrey Balmin: FLEX: A Slot Allocation Scheduling Optimizer for MapReduce Workloads. Middleware 2010: 1-20

Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. CoRR abs/1003.2977 (2010)

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

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

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

Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan: Additive Guarantees for Degree-Bounded Directed Network Design. SIAM J. Comput. 39(4): 1413-1431 (2009)

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

Rohit Khandekar, Guy Kortsarz, Zeev Nutov: Approximating Fault-Tolerant Group-Steiner Problems. FSTTCS 2009: 263-274

Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Jay Sethuraman, Joel L. Wolf: Bounded Size Graph Clustering with Applications to Stream Processing. FSTTCS 2009: 275-286

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

Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Joel L. Wolf, Kun-Lung Wu, Henrique Andrade, Bugra Gedik: COLA: Optimizing Stream Processing Applications via Graph Partitioning. Middleware 2009: 308-327

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

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

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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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)

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

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

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

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

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

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