Chaitanya Swamy

135 papers A* 35A 10B 10Journal 65Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Unsplittable Cost Flows from Unweighted Error-Bounded Variants. SOSA Chaitanya Swamy, Vera Traub, Laura Vargas Koch, Rico Zenklusen
2025	J	`jnl`	Almost Tight Additive Guarantees for CoRR Nikhil Kumar, Chaitanya Swamy
2025	A*	`conf`	Almost Tight Additive Guarantees for k-Edge-Connectivity. FOCS Nikhil Kumar, Chaitanya Swamy
2025	A*	`conf`	An EC Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2025	J	`jnl`	An O(log log n)-approximate budget feasible mechanism for subadditive valuations. CoRR Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2025	J	`jnl`	Constant-Factor Distortion Mechanisms for CoRR Haripriya Pulyassary, Chaitanya Swamy
2025	A*	`conf`	Constant-Factor Distortion Mechanisms for k-Committee Election. AAAI Haripriya Pulyassary, Chaitanya Swamy
2025	J	`jnl`	Multidimensional Budget-Feasible Mechanism Design. CoRR Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2025	A	`conf`	Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique. ESA Nikhil Kumar, J. J. Nan, Chaitanya Swamy
2025	J	`jnl`	Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique. CoRR Nikhil Kumar, J. J. Nan, Chaitanya Swamy
2025	J	`jnl`	Unsplittable Cost Flows from Unweighted Error-Bounded Variants. CoRR Chaitanya Swamy, Vera Traub, Laura Vargas Koch, Rico Zenklusen
2024	A	`conf`	Approximation Algorithms for Correlated Knapsack Orienteering. APPROX/RANDOM David Alemán Espinosa, Chaitanya Swamy
2024	J	`jnl`	Approximation Algorithms for Correlated Knapsack Orienteering. CoRR David Alemán Espinosa, Chaitanya Swamy
2024	A	`conf`	Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints. ITCS Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
2022	—	`conf`	A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. SOSA Sharat Ibrahimpur, Chaitanya Swamy
2022	J	`jnl`	A constant-factor approximation for directed latency in quasi-polynomial time. J. Comput. Syst. Sci. Zachary Friggstad, Chaitanya Swamy
2022	A	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference), September 19-21, 2022 APPROX/RANDOM Amit Chakrabarti, Chaitanya Swamy
2022	B	`conf`	Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. IPCO Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy
2021	J	`jnl`	A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing. CoRR Sharat Ibrahimpur, Chaitanya Swamy
2021	J	`jnl`	Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems. CoRR Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy
2021	A*	`conf`	Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime. ICALP Zachary Friggstad, Chaitanya Swamy
2021	A*	`conf`	Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan. ICALP Sharat Ibrahimpur, Chaitanya Swamy
2021	J	`jnl`	On the Randomized Metric Distortion Conjecture. CoRR Haripriya Pulyassary, Chaitanya Swamy
2020	A	`conf`	A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. ESA Zachary Friggstad, Chaitanya Swamy
2020	J	`jnl`	Approximate multi-matroid intersection via iterative refinement. Math. Program. André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2020	J	`jnl`	Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization. CoRR Sharat Ibrahimpur, Chaitanya Swamy
2020	A*	`conf`	Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization. FOCS Sharat Ibrahimpur, Chaitanya Swamy
2020	J	`jnl`	Special Section on the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017). SIAM J. Comput. Valentine Kabanets, Sofya Raskhodnikova, Chaitanya Swamy
2019	J	`jnl`	A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time. CoRR Zachary Friggstad, Chaitanya Swamy
2019	J	`jnl`	Achieving target equilibria in network routing games without knowing the latency functions. Games Econ. Behav. Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy
2019	B	`conf`	Approximate Multi-matroid Intersection via Iterative Refinement. IPCO André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2019	J	`jnl`	Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box Distributions. CoRR André Linhares, Chaitanya Swamy
2019	A*	`conf`	Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions. STOC André Linhares, Chaitanya Swamy
2019	A*	`conf`	Approximation algorithms for minimum norm and ordered optimization problems. STOC Deeparnab Chakrabarty, Chaitanya Swamy
2019	J	`jnl`	Black-box reductions for cost-sharing mechanism design. Games Econ. Behav. Konstantinos Georgiou, Chaitanya Swamy
2019	A	`conf`	Simpler and Better Algorithms for Minimum-Norm Load Balancing. ESA Deeparnab Chakrabarty, Chaitanya Swamy
2019	J	`jnl`	Simpler and Better Algorithms for Minimum-Norm Load Balancing. CoRR Deeparnab Chakrabarty, Chaitanya Swamy
2018	A	`conf`	Algorithms for Inverse Optimization Problems. ESA Sara Ahmadian, Umang Bhaskar, Laura Sanità, Chaitanya Swamy
2018	J	`jnl`	Approximate Multi-Matroid Intersection via Iterative Refinement. CoRR André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
2018	J	`jnl`	Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. Math. Program. André Linhares, Chaitanya Swamy
2018	J	`jnl`	Approximation Algorithms for Minimum Norm and Ordered Optimization Problems. CoRR Deeparnab Chakrabarty, Chaitanya Swamy
2018	J	`jnl`	Approximation Algorithms for Minimum-Load ACM Trans. Algorithms Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy
2018	A*	`conf`	Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. ICALP Deeparnab Chakrabarty, Chaitanya Swamy
2018	A*	`conf`	Minimizing Latency in Online Ride and Delivery Services. WWW Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy
2018	J	`jnl`	Minimizing Latency in Online Ride and Delivery Services. CoRR Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim, Debmalya Panigrahi, Chaitanya Swamy
2018	A	`conf`	Orienteering Algorithms for Generating Travel Itineraries. WSDM Zachary Friggstad, Sreenivas Gollapudi, Kostas Kollias, Tamás Sarlós, Chaitanya Swamy, Andrew Tomkins
2017	B	`conf`	Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. IPCO Zachary Friggstad, Chaitanya Swamy
2017	J	`jnl`	Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing. CoRR Zachary Friggstad, Chaitanya Swamy
2017	A*	`conf`	Improved Algorithms for MST and Metric-TSP Interdiction. ICALP André Linhares, Chaitanya Swamy
2017	J	`jnl`	Improved Algorithms for MST and Metric-TSP Interdiction. CoRR André Linhares, Chaitanya Swamy
2017	J	`jnl`	Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median. CoRR Deeparnab Chakrabarty, Chaitanya Swamy
2017	B	`conf`	Min-Max Theorems for Packing and Covering Odd (u, v)-trails. IPCO Sharat Ibrahimpur, Chaitanya Swamy
2017	J	`jnl`	Min-Max Theorems for Packing and Covering Odd (u, v)-trails. CoRR Sharat Ibrahimpur, Chaitanya Swamy
2017	—	`conf`	On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
2017	J	`jnl`	On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
2016	B	`conf`	Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. IPCO André Linhares, Chaitanya Swamy
2016	J	`jnl`	Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. CoRR André Linhares, Chaitanya Swamy
2016	A*	`conf`	Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers. ICALP Sara Ahmadian, Chaitanya Swamy
2016	J	`jnl`	Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers. CoRR Sara Ahmadian, Chaitanya Swamy
2016	J	`jnl`	Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems. Math. Oper. Res. Deeparnab Chakrabarty, Chaitanya Swamy
2016	A*	`conf`	Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games. EC Umang Bhaskar, Yu Cheng, Young Kun-Ko, Chaitanya Swamy
2016	J	`jnl`	Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications. ACM Trans. Algorithms Chaitanya Swamy
2015	J	`jnl`	Computing Optimal Tolls in Routing Games without Knowing the Latency Functions. CoRR Siddharth Barman, Umang Bhaskar, Chaitanya Swamy
2015	A*	`conf`	Improved Region-Growing and Combinatorial Algorithms for SODA Guru Guruganesh, Laura Sanità, Chaitanya Swamy
2015	A*	`conf`	Learning Arbitrary Statistical Mixtures of Discrete Distributions. STOC Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2015	J	`jnl`	Learning Arbitrary Statistical Mixtures of Discrete Distributions. CoRR Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2015	A*	`conf`	Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract). SODA Ian Post, Chaitanya Swamy
2015	J	`jnl`	Near-Optimal Hardness Results for Signaling in Bayesian Games. CoRR Umang Bhaskar, Yu Cheng, Young Kun-Ko, Chaitanya Swamy
2015	J	`jnl`	Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players. ACM Trans. Economics and Comput. Hadi Minooei, Chaitanya Swamy
2014	A*	`conf`	Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. FOCS Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy
2014	J	`jnl`	Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions. CoRR Umang Bhaskar, Katrina Ligett, Leonard J. Schulman, Chaitanya Swamy
2014	—	`conf`	Approximation Algorithms for Minimum-Load k-Facility Location. APPROX-RANDOM Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy
2014	A*	`conf`	Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. STOC Zachary Friggstad, Chaitanya Swamy
2014	—	`conf`	Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications. APPROX-RANDOM Chaitanya Swamy
2014	J	`jnl`	Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems. CoRR Guru Guruganesh, Laura Sanità, Chaitanya Swamy
2014	A	`conf`	Learning mixtures of arbitrary distributions over large discrete domains. ITCS Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2014	J	`jnl`	Linear-Programming based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems. CoRR Ian Post, Chaitanya Swamy
2014	A	`conf`	Welfare maximization and truthfulness in mechanism design with ordinal preferences. ITCS Deeparnab Chakrabarty, Chaitanya Swamy
2013	J	`jnl`	Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply. CoRR Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swamy
2013	J	`jnl`	Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications to Distance-Constrained Vehicle Routing. CoRR Zachary Friggstad, Chaitanya Swamy
2013	J	`jnl`	Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications. CoRR Chaitanya Swamy
2013	J	`jnl`	Local-Search based Approximation Algorithms for Mobile Facility Location Problems CoRR Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy
2013	A*	`conf`	Local-Search based Approximation Algorithms for Mobile Facility Location Problems. SODA Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy
2013	—	`conf`	Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players. WINE Hadi Minooei, Chaitanya Swamy
2013	J	`jnl`	Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players. CoRR Hadi Minooei, Chaitanya Swamy
2013	J	`jnl`	Welfare Maximization and Truthfulness in Mechanism Design with Ordinal Preferences. CoRR Deeparnab Chakrabarty, Chaitanya Swamy
2012	J	`jnl`	Approximability of the Firefighter Problem - Computing Cuts over Time. Algorithmica Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy
2012	A*	`conf`	Black-box reductions for cost-sharing mechanism design. SODA Konstantinos Georgiou, Chaitanya Swamy
2012	B	`conf`	Improved Approximation Guarantees for Lower-Bounded Facility Location. WAOA Sara Ahmadian, Chaitanya Swamy
2012	J	`jnl`	LP-based approximation algorithms for capacitated facility location. Math. Program. Retsef Levi, David B. Shmoys, Chaitanya Swamy
2012	J	`jnl`	Learning Mixtures of Arbitrary Distributions over Large Discrete Domains CoRR Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2012	J	`jnl`	Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization. SIAM J. Comput. Chaitanya Swamy, David B. Shmoys
2012	J	`jnl`	The effectiveness of lloyd-type methods for the k-means problem. J. ACM Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2012	J	`jnl`	The effectiveness of stackelberg strategies and tolls for network congestion games. ACM Trans. Algorithms Chaitanya Swamy
2012	J	`jnl`	Truthful Mechanism Design for Multidimensional Covering Problems CoRR Hadi Minooei, Chaitanya Swamy
2012	—	`conf`	Truthful Mechanism Design for Multidimensional Covering Problems. WINE Hadi Minooei, Chaitanya Swamy
2011	B	`conf`	Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. IPCO Deeparnab Chakrabarty, Chaitanya Swamy
2011	J	`jnl`	Improved Approximation Guarantees for Lower-Bounded Facility Location CoRR Sara Ahmadian, Chaitanya Swamy
2011	A*	`conf`	Risk-Averse Stochastic Optimization: Probabilistically-Constrained Models and Algorithms for Black-Box Distributions. SODA Chaitanya Swamy
2011	J	`jnl`	Truthful and Near-Optimal Mechanism Design via Linear Programming. J. ACM Ron Lavi, Chaitanya Swamy
2010	—	`conf`	Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply. WINE Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swamy
2010	J	`jnl`	Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems CoRR Deeparnab Chakrabarty, Chaitanya Swamy
2010	B	`conf`	Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. IPCO Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy
2010	J	`jnl`	Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm CoRR Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy
2009	B	`conf`	Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. ISAAC Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy
2009	J	`jnl`	Truthful mechanism design for multidimensional scheduling via cycle monotonicity. Games Econ. Behav. Ron Lavi, Chaitanya Swamy
2008	J	`jnl`	Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions CoRR Chaitanya Swamy
2008	J	`jnl`	Approximation Algorithms for Data Placement Problems. SIAM J. Comput. Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
2008	A*	`conf`	Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply. FOCS Maurice Cheung, Chaitanya Swamy
2008	A*	`conf`	Approximation algorithms for labeling hierarchical taxonomies. SODA Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2008	J	`jnl`	Fault-tolerant facility location. ACM Trans. Algorithms Chaitanya Swamy, David B. Shmoys
2008	J	`jnl`	Optimal Power-Down Strategies. SIAM J. Comput. John Augustine, Sandy Irani, Chaitanya Swamy
2007	A*	`conf`	Approximation algorithms for prize collecting forest problems with submodular penalty functions. SODA Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson
2007	—	`conf`	Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization. Probabilistic Methods in the Design and Analysis of Algorithms Chaitanya Swamy, David B. Shmoys
2007	A*	`conf`	The effectiveness of Stackelberg strategies and tolls for network congestion games. SODA Chaitanya Swamy
2007	A*	`conf`	Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. EC Ron Lavi, Chaitanya Swamy
2006	J	`jnl`	An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM David B. Shmoys, Chaitanya Swamy
2006	—	`conf`	Approximation Algorithms for 2-Stage Stochastic Optimization Problems. FSTTCS Chaitanya Swamy, David B. Shmoys
2006	—	`conf`	Approximation Algorithms for Graph Homomorphism Problems. APPROX-RANDOM Michael Langberg, Yuval Rabani, Chaitanya Swamy
2006	J	`jnl`	Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News Chaitanya Swamy, David B. Shmoys
2006	A*	`conf`	The Effectiveness of Lloyd-Type Methods for the k-Means Problem. FOCS Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
2005	—	`conf`	Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. Algorithms for Optimization with Incomplete Information Chaitanya Swamy, David B. Shmoys
2005	A*	`conf`	Network design for information networks. SODA Ara Hayrapetyan, Chaitanya Swamy, Éva Tardos
2005	A*	`conf`	Sampling-based Approximation Algorithms for Multi-stage Stochastic. FOCS Chaitanya Swamy, David B. Shmoys
2005	A*	`conf`	Truthful and Near-Optimal Mechanism Design via Linear Programming. FOCS Ron Lavi, Chaitanya Swamy
2004	—	`—`	Approximation Algorithms for Clustering Problems. Chaitanya Swamy
2004	A*	`conf`	Correlation Clustering: maximizing agreements via semidefinite programming. SODA Chaitanya Swamy
2004	A*	`conf`	Facility location with Service Installation Costs. SODA David B. Shmoys, Chaitanya Swamy, Retsef Levi
2004	B	`conf`	LP-based Approximation Algorithms for Capacitated Facility Location. IPCO Retsef Levi, David B. Shmoys, Chaitanya Swamy
2004	A*	`conf`	Optimal Power-Down Strategies. FOCS John Augustine, Sandy Irani, Chaitanya Swamy
2004	J	`jnl`	Primal-Dual Algorithms for Connected Facility Location Problems. Algorithmica Chaitanya Swamy, Amit Kumar
2004	A*	`conf`	Stochastic Optimization is (Almost) as easy as Deterministic Optimization. FOCS David B. Shmoys, Chaitanya Swamy
2003	A*	`conf`	Fault-tolerant facility location. SODA Chaitanya Swamy, David B. Shmoys
2002	—	`conf`	Primal-Dual Algorithms for Connected Facility Location Problems. APPROX Chaitanya Swamy, Amit Kumar
1999	—	`conf`	A Randomized Algorithm for Flow Shop Scheduling. FSTTCS Naveen Garg, Sachin Jain, Chaitanya Swamy