Chaitanya Swamy

According to our database1, Chaitanya Swamy authored at least 104 papers between 1999 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Black-box reductions for cost-sharing mechanism design.
Games and Economic Behavior, 2019

Simpler and Better Algorithms for Minimum-Norm Load Balancing.
CoRR, 2019

Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box Distributions.
CoRR, 2019

Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Approximation algorithms for minimum norm and ordered optimization problems.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Approximate Multi-matroid Intersection via Iterative Refinement.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

Simpler and Better Algorithms for Minimum-Norm Load Balancing.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Approximation Algorithms for Minimum-Load k-Facility Location.
ACM Trans. Algorithms, 2018

Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems.
Math. Program., 2018

Approximate Multi-Matroid Intersection via Iterative Refinement.
CoRR, 2018

Approximation Algorithms for Minimum Norm and Ordered Optimization Problems.
CoRR, 2018

Minimizing Latency in Online Ride and Delivery Services.
CoRR, 2018

Minimizing Latency in Online Ride and Delivery Services.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Orienteering Algorithms for Generating Travel Itineraries.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Algorithms for Inverse Optimization Problems.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median.
CoRR, 2017

Min-Max Theorems for Packing and Covering Odd (u, v)-trails.
CoRR, 2017

Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing.
CoRR, 2017

Improved Algorithms for MST and Metric-TSP Interdiction.
CoRR, 2017

On the Integrality Gap of the Prize-Collecting Steiner Forest LP.
CoRR, 2017

Min-Max Theorems for Packing and Covering Odd (u, v)-trails.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Improved Algorithms for MST and Metric-TSP Interdiction.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

On the Integrality Gap of the Prize-Collecting Steiner Forest LP.
Proceedings of the Approximation, 2017

2016
Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications.
ACM Trans. Algorithms, 2016

Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems.
Math. Oper. Res., 2016

Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems.
CoRR, 2016

Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers.
CoRR, 2016

Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players.
ACM Trans. Economics and Comput., 2015

Learning Arbitrary Statistical Mixtures of Discrete Distributions.
CoRR, 2015

Near-Optimal Hardness Results for Signaling in Bayesian Games.
CoRR, 2015

Computing Optimal Tolls in Routing Games without Knowing the Latency Functions.
CoRR, 2015

Learning Arbitrary Statistical Mixtures of Discrete Distributions.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract).
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Improved Region-Growing and Combinatorial Algorithms for k-Route Cut Problems (Extended Abstract).
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Linear-Programming based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems.
CoRR, 2014

Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems.
CoRR, 2014

Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions.
CoRR, 2014

Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing.
Proceedings of the Symposium on Theory of Computing, 2014

Learning mixtures of arbitrary distributions over large discrete domains.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Welfare maximization and truthfulness in mechanism design with ordinal preferences.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications.
Proceedings of the Approximation, 2014

Approximation Algorithms for Minimum-Load k-Facility Location.
Proceedings of the Approximation, 2014

2013
Local-Search based Approximation Algorithms for Mobile Facility Location Problems
CoRR, 2013

Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications.
CoRR, 2013

Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players.
CoRR, 2013

Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications to Distance-Constrained Vehicle Routing.
CoRR, 2013

Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply.
CoRR, 2013

Welfare Maximization and Truthfulness in Mechanism Design with Ordinal Preferences.
CoRR, 2013

Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Local-Search based Approximation Algorithms for Mobile Facility Location Problems.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
The effectiveness of stackelberg strategies and tolls for network congestion games.
ACM Trans. Algorithms, 2012

Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization.
SIAM J. Comput., 2012

LP-based approximation algorithms for capacitated facility location.
Math. Program., 2012

The effectiveness of lloyd-type methods for the k-means problem.
J. ACM, 2012

Learning Mixtures of Arbitrary Distributions over Large Discrete Domains
CoRR, 2012

Truthful Mechanism Design for Multidimensional Covering Problems
CoRR, 2012

Approximability of the Firefighter Problem - Computing Cuts over Time.
Algorithmica, 2012

Truthful Mechanism Design for Multidimensional Covering Problems.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Improved Approximation Guarantees for Lower-Bounded Facility Location.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Black-box reductions for cost-sharing mechanism design.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Truthful and Near-Optimal Mechanism Design via Linear Programming.
J. ACM, 2011

Improved Approximation Guarantees for Lower-Bounded Facility Location
CoRR, 2011

Risk-Averse Stochastic Optimization: Probabilistically-Constrained Models and Algorithms for Black-Box Distributions.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
CoRR, 2010

Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm
CoRR, 2010

Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009
Truthful mechanism design for multidimensional scheduling via cycle monotonicity.
Games and Economic Behavior, 2009

Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Fault-tolerant facility location.
ACM Trans. Algorithms, 2008

Approximation Algorithms for Data Placement Problems.
SIAM J. Comput., 2008

Optimal Power-Down Strategies.
SIAM J. Comput., 2008

Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions
CoRR, 2008

Approximation algorithms for labeling hierarchical taxonomies.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
The effectiveness of Stackelberg strategies and tolls for network congestion games.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Approximation algorithms for prize collecting forest problems with submodular penalty functions.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization.
Proceedings of the Probabilistic Methods in the Design and Analysis of Algorithms, 23.09., 2007

2006
Approximation algorithms for 2-stage stochastic optimization problems.
SIGACT News, 2006

An approximation scheme for stochastic linear programming and its application to stochastic integer programs.
J. ACM, 2006

Approximation Algorithms for 2-Stage Stochastic Optimization Problems.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

The Effectiveness of Lloyd-Type Methods for the k-Means Problem.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Approximation Algorithms for Graph Homomorphism Problems.
Proceedings of the Approximation, 2006

2005
Network design for information networks.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Sampling-based Approximation Algorithms for Multi-stage Stochastic.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Truthful and Near-Optimal Mechanism Design via Linear Programming.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
Primal-Dual Algorithms for Connected Facility Location Problems.
Algorithmica, 2004

Correlation Clustering: maximizing agreements via semidefinite programming.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Facility location with Service Installation Costs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

LP-based Approximation Algorithms for Capacitated Facility Location.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Stochastic Optimization is (Almost) as easy as Deterministic Optimization.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

Optimal Power-Down Strategies.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003
Fault-tolerant facility location.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Primal-Dual Algorithms for Connected Facility Location Problems.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

1999
A Randomized Algorithm for Flow Shop Scheduling.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999


  Loading...