Rohit Khandekar

SIAM J. Discret. Math., 2017

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

[BibT_eX]

[DOI]

Rajesh Chitnis

Hossein Esfandiari

Saeed Seddighin

Algorithmica, 2017

2016

A Simple and Efficient Algorithm for Computing Market Equilibria.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Dynamic Load Balancing for Ordered Data-Parallel Regions in Distributed Streaming Systems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Middleware Conference, Trento, Italy, December 12, 2016

Bicovering: Covering Edges With Two Small Subsets of Vertices.

[BibT_eX]

[DOI]

Amey Bhangale

Rajiv Gandhi

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Real-time scheduling to minimize machine busy times.

[BibT_eX]

[DOI]

J. Sched., 2015

2014

Fast Nearest Neighbor Search on Large Time-Evolving Graphs.

[BibT_eX]

[DOI]

Leman Akoglu

Vibhore Kumar

Srinivasan Parthasarathy

Deepak Rajan

Kun-Lung Wu

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).

[BibT_eX]

[DOI]

Rajesh Hemant Chitnis

Hossein Esfandiari

Saeed Seddighin

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

A Distributed Algorithm for Large-Scale Generalized Matching.

[BibT_eX]

[DOI]

Faraz Makari Manshadi

Proc. VLDB Endow., 2013

On some network design problems with degree constraints.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

IBM Streams Processing Language: Analyzing Big Data in motion.

[BibT_eX]

[DOI]

Martin Hirzel

Henrique Andrade

Bugra Gedik

Gabriela Jacques-Silva

IBM J. Res. Dev., 2013

The Foundations of Fixed Parameter Inapproximability.

[BibT_eX]

[DOI]

CoRR, 2013

On Fixed Cost k-Flow Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Approximation Algorithms for Movement Repairmen.

[BibT_eX]

[DOI]

M. Reza Khani

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

On the optimization of schedules for MapReduce workloads in the presence of shared scans.

[BibT_eX]

[DOI]

VLDB J., 2012

CIRCUMFLEX: a scheduling optimizer for MapReduce workloads with shared scans.

[BibT_eX]

[DOI]

ACM SIGOPS Oper. Syst. Rev., 2012

Local Search Algorithms for the Red-Blue Median Problem.

[BibT_eX]

[DOI]

Algorithmica, 2012

Advantage of Overlapping Clusters for Minimizing Conductance.

[BibT_eX]

[DOI]

Vahab S. Mirrokni

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Clustering Streaming Graphs.

[BibT_eX]

[DOI]

Ahmed Eldawy

Kun-Lung Wu

Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems, 2012

Scheduling with Setup Costs and Monotone Penalties.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Rahul Garg

Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011

Combinatorial Algorithms for Capacitated Network Design

[BibT_eX]

[DOI]

CoRR, 2011

On a local protocol for concurrent file transfers.

[BibT_eX]

[DOI]

Vahid Liaghat

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Network-Design with Degree Constraints.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

FLEX: A Slot Allocation Scheduling Optimizer for MapReduce Workloads.

[BibT_eX]

[DOI]

Proceedings of the Middleware 2010 - ACM/IFIP/USENIX 11th International Middleware Conference, Bangalore, India, November 29, 2010

Prize-Collecting Steiner Network Problems.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

On Generalizations of Network Design Problems with Degree Bounds.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Minimizing Busy Time in Multiple Machine Real-time Scheduling.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Budgeted Red-Blue Median and Its Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

The Checkpoint Problem.

[BibT_eX]

[DOI]

Julián Mestre

Proceedings of the Approximation, 2010

2009

A logarithmic approximation for unsplittable flow on line graphs.

[BibT_eX]

[DOI]

Nikhil Bansal

Zachary Friggstad

Mohammad R. Salavatipour

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Brief announcement: Stateless distributed algorithms for generalized packing linear programs.

[BibT_eX]

[DOI]

Zhenghua Fu

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

COLA: Optimizing Stream Processing Applications via Graph Partitioning.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Rahul Garg

Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Approximating Fault-Tolerant Group-Steiner Problems.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Bounded Size Graph Clustering with Applications to Stream Processing.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Tracy Kimbrel

Konstantin Makarychev

Maxim Sviridenko

Proceedings of the Approximation, 2009

2008

On the integrality ratio for tree augmentation.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

A Fast and Simple Algorithm for Computing Market Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Additive guarantees for degree bounded directed network design.

[BibT_eX]

[DOI]

Nikhil Bansal

Viswanath Nagarajan

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Stateless distributed gradient descent for positive linear programs.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Cost sharing mechanisms for near-optimal traffic aggregation and network design.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Yossi Azar

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Stateless distributed algorithms for near optimal maximum multicommodity flows.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Greedy distributed optimization of unsplittable multicommodity flows.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Stateless Near Optimal Flow Control with Poly-logarithmic Convergence.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Two-Stage Robust Network Design with Exponential Scenarios.

[BibT_eX]

[DOI]

Vahab S. Mirrokni

Mohammad R. Salavatipour

Proceedings of the Algorithms, 2008

2007

Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.

[BibT_eX]

[DOI]

Satish Rao

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On cost sharing mechanisms in the network design game.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Distributed network monitoring and multicommodity flows: a primal-dual approach.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Greedy distributed optimization of multi-commodity flows.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Non-Preemptive Min-Sum Scheduling with Resource Augmentation.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

2006

Graph partitioning using single commodity flows.

[BibT_eX]

[DOI]

Satish Rao

Umesh V. Vazirani

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Online Sorting Buffers on Line.

[BibT_eX]

[DOI]

Proceedings of the STACS 2006, 2006

Offline Sorting Buffers on Line.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Price of Anarchy, Locality Gap, and a Network Service Provider Game.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Improved approximation for universal facility location.

[BibT_eX]

[DOI]

Naveen Garg

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Local Search Heuristics for k-Median and Facility Location Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries.

[BibT_eX]

[DOI]

Naveen Garg

Proceedings of the Algorithms, 2004

An Efficient Central Path Algorithm for Virtual Navigation.

[BibT_eX]

[DOI]

Proceedings of the 2004 Computer Graphics International (CGI 2004), 16-19 June 2004, 2004

2003

Bandwidth Maximization in Multicasting.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems.

[BibT_eX]

[DOI]

Naveen Garg