Rohit Khandekar

According to our database1, Rohit Khandekar authored at least 67 papers between 2001 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Bi-Covering: Covering Edges with Two Small Subsets of Vertices.
SIAM J. Discrete Math., 2017

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands.
Algorithmica, 2017

2016
Approximation Algorithms for Movement Repairmen.
ACM Trans. Algorithms, 2016

A Simple and Efficient Algorithm for Computing Market Equilibria.
ACM Trans. Algorithms, 2016

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.
ACM Trans. Algorithms, 2016

On Fixed Cost k-Flow Problems.
Theory Comput. Syst., 2016

Bicovering: Covering edges with two small subsets of vertices.
Electronic Colloquium on Computational Complexity (ECCC), 2016

Dynamic Load Balancing for Ordered Data-Parallel Regions in Distributed Streaming Systems.
Proceedings of the 17th International Middleware Conference, Trento, Italy, December 12, 2016

2015
Real-time scheduling to minimize machine busy times.
J. Scheduling, 2015

2014
A logarithmic approximation for unsplittable flow on line graphs.
ACM Trans. Algorithms, 2014

On a Local Protocol for Concurrent File Transfers.
Theory Comput. Syst., 2014

On the Advantage of Overlapping Clusters for Minimizing Conductance.
Algorithmica, 2014

Fast Nearest Neighbor Search on Large Time-Evolving Graphs.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract).
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013
A Distributed Algorithm for Large-Scale Generalized Matching.
PVLDB, 2013

On generalizations of network design problems with degree bounds.
Math. Program., 2013

On some network design problems with degree constraints.
J. Comput. Syst. Sci., 2013

IBM Streams Processing Language: Analyzing Big Data in motion.
IBM Journal of Research and Development, 2013

The Foundations of Fixed Parameter Inapproximability.
CoRR, 2013

Two-stage Robust Network Design with Exponential Scenarios.
Algorithmica, 2013

2012
On the optimization of schedules for MapReduce workloads in the presence of shared scans.
VLDB J., 2012

Approximating fault-tolerant group-Steiner problems.
Theor. Comput. Sci., 2012

The checkpoint problem.
Theor. Comput. Sci., 2012

Prize-collecting steiner network problems.
ACM Trans. Algorithms, 2012

Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.
ACM Trans. Algorithms, 2012

CIRCUMFLEX: a scheduling optimizer for MapReduce workloads with shared scans.
Operating Systems Review, 2012

Local Search Algorithms for the Red-Blue Median Problem.
Algorithmica, 2012

Clustering Streaming Graphs.
Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

Scheduling with Setup Costs and Monotone Penalties.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Block-sparse Solutions using Kernel Block RIP and its Application to Group Lasso.
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011

Combinatorial Algorithms for Capacitated Network Design
CoRR, 2011

Network-Design with Degree Constraints.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Online and offline algorithms for the sorting buffers problem on the line metric.
J. Discrete Algorithms, 2010

FLEX: A Slot Allocation Scheduling Optimizer for MapReduce Workloads.
Proceedings of the Middleware 2010 - ACM/IFIP/USENIX 11th International Middleware Conference, Bangalore, India, November 29, 2010

Minimizing Busy Time in Multiple Machine Real-time Scheduling.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Budgeted Red-Blue Median and Its Generalizations.
Proceedings of the Algorithms, 2010

2009
Additive Guarantees for Degree-Bounded Directed Network Design.
SIAM J. Comput., 2009

Stateless Distributed Gradient Descent for Positive Linear Programs.
SIAM J. Comput., 2009

Graph partitioning using single commodity flows.
J. ACM, 2009

Greedy distributed optimization of multi-commodity flows.
Distributed Computing, 2009

Brief announcement: Stateless distributed algorithms for generalized packing linear programs.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

COLA: Optimizing Stream Processing Applications via Graph Partitioning.
Proceedings of the Middleware 2009, ACM/IFIP/USENIX, 10th International Middleware Conference, Urbana, IL, USA, November 30, 2009

Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Bounded Size Graph Clustering with Applications to Stream Processing.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

On Hardness of Pricing Items for Single-Minded Bidders.
Proceedings of the Approximation, 2009

2008
On the integrality ratio for tree augmentation.
Oper. Res. Lett., 2008

A Fast and Simple Algorithm for Computing Market Equilibria.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Cost sharing mechanisms for near-optimal traffic aggregation and network design.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Fast load balancing via bounded best response.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Stateless distributed algorithms for near optimal maximum multicommodity flows.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Greedy distributed optimization of unsplittable multicommodity flows.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Stateless Near Optimal Flow Control with Poly-logarithmic Convergence.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
On cost sharing mechanisms in the network design game.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Distributed network monitoring and multicommodity flows: a primal-dual approach.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Non-Preemptive Min-Sum Scheduling with Resource Augmentation.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
Online Sorting Buffers on Line.
Proceedings of the STACS 2006, 2006

Offline Sorting Buffers on Line.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005
Price of Anarchy, Locality Gap, and a Network Service Provider Game.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Improved approximation for universal facility location.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Local Search Heuristics for k-Median and Facility Location Problems.
SIAM J. Comput., 2004

Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries.
Proceedings of the Algorithms, 2004

An Efficient Central Path Algorithm for Virtual Navigation.
Proceedings of the 2004 Computer Graphics International (CGI 2004), 16-19 June 2004, 2004

2003
Bandwidth Maximization in Multicasting.
Proceedings of the Algorithms, 2003

2002
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Local search heuristic for k-median and facility location problems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001


  Loading...