- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c29 |      | Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy: Local-Search based Approximation Algorithms for Mobile Facility Location Problems. SODA 2013: 1607-1621 |
| i7 | | Sara Ahmadian, Zachary Friggstad, Chaitanya Swamy: Local-Search based Approximation Algorithms for Mobile Facility Location Problems. CoRR abs/1301.4478 (2013) |
| 2012 | ||
| j13 | | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy: Approximability of the Firefighter Problem - Computing Cuts over Time. Algorithmica 62(1-2): 520-536 (2012) |
| j12 | | Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy: The effectiveness of lloyd-type methods for the k-means problem. J. ACM 59(6): 28 (2012) |
| j11 | | Retsef Levi, David B. Shmoys, Chaitanya Swamy: LP-based approximation algorithms for capacitated facility location. Math. Program. 131(1-2): 365-379 (2012) |
| j10 | | Chaitanya Swamy, David B. Shmoys: Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization. SIAM J. Comput. 41(4): 975-1004 (2012) |
| j9 | | Chaitanya Swamy: The effectiveness of stackelberg strategies and tolls for network congestion games. ACM Transactions on Algorithms 8(4): 36 (2012) |
| c28 | | Konstantinos Georgiou, Chaitanya Swamy: Black-box reductions for cost-sharing mechanism design. SODA 2012: 896-913 |
| c27 | | Hadi Minooei, Chaitanya Swamy: Truthful Mechanism Design for Multidimensional Covering Problems. WINE 2012: 448-461 |
| i6 | | Hadi Minooei, Chaitanya Swamy: Truthful Mechanism Design for Multidimensional Covering Problems. CoRR abs/1211.3201 (2012) |
| i5 | | Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy: Learning Mixtures of Arbitrary Distributions over Large Discrete Domains. CoRR abs/1212.1527 (2012) |
| 2011 | ||
| j8 | | |
| c26 | | Deeparnab Chakrabarty, Chaitanya Swamy: Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems. IPCO 2011: 92-103 |
| c25 | | Chaitanya Swamy: Risk-Averse Stochastic Optimization: Probabilistically-Constrained Models and Algorithms for Black-Box Distributions. SODA 2011: 1627-1646 |
| i4 | | Sara Ahmadian, Chaitanya Swamy: Improved Approximation Guarantees for Lower-Bounded Facility Location. CoRR abs/1104.3128 (2011) |
| 2010 | ||
| c24 | | Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy: Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm. IPCO 2010: 244-257 |
| c23 | | Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swamy: Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply. WINE 2010: 462-472 |
| i3 | | Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy: Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm. CoRR abs/1003.1295 (2010) |
| i2 | | Deeparnab Chakrabarty, Chaitanya Swamy: Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems. CoRR abs/1009.2452 (2010) |
| 2009 | ||
| j7 | | Ron Lavi, Chaitanya Swamy: Truthful mechanism design for multidimensional scheduling via cycle monotonicity. Games and Economic Behavior 67(1): 99-124 (2009) |
| c22 | | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy: Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. ISAAC 2009: 974-983 |
| 2008 | ||
| j6 | | John Augustine, Sandy Irani, Chaitanya Swamy: Optimal Power-Down Strategies. SIAM J. Comput. 37(5): 1499-1516 (2008) |
| j5 | | Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy: Approximation Algorithms for Data Placement Problems. SIAM J. Comput. 38(4): 1411-1429 (2008) |
| j4 | | Chaitanya Swamy, David B. Shmoys: Fault-tolerant facility location. ACM Transactions on Algorithms 4(4) (2008) |
| c21 | | Maurice Cheung, Chaitanya Swamy: Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply. FOCS 2008: 35-44 |
| c20 | | Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy: Approximation algorithms for labeling hierarchical taxonomies. SODA 2008: 671-680 |
| i1 | | Chaitanya Swamy: Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions. CoRR abs/0805.0389 (2008) |
| 2007 | ||
| c19 | | Chaitanya Swamy, David B. Shmoys: Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization. Probabilistic Methods in the Design and Analysis of Algorithms 2007 |
| c18 | | Ron Lavi, Chaitanya Swamy: Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. ACM Conference on Electronic Commerce 2007: 252-261 |
| c17 | | Chaitanya Swamy: The effectiveness of Stackelberg strategies and tolls for network congestion games. SODA 2007: 1133-1142 |
| c16 | | Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson: Approximation algorithms for prize collecting forest problems with submodular penalty functions. SODA 2007: 1275-1284 |
| 2006 | ||
| j3 | | David B. Shmoys, Chaitanya Swamy: An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53(6): 978-1012 (2006) |
| j2 | | Chaitanya Swamy, David B. Shmoys: Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News 37(1): 33-46 (2006) |
| c15 | | Michael Langberg, Yuval Rabani, Chaitanya Swamy: Approximation Algorithms for Graph Homomorphism Problems. APPROX-RANDOM 2006: 176-187 |
| c14 | | Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy: The Effectiveness of Lloyd-Type Methods for the k-Means Problem. FOCS 2006: 165-176 |
| c13 | | Chaitanya Swamy, David B. Shmoys: Approximation Algorithms for 2-Stage Stochastic Optimization Problems. FSTTCS 2006: 5-19 |
| 2005 | ||
| c12 | | Chaitanya Swamy, David B. Shmoys: Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. Algorithms for Optimization with Incomplete Information 2005 |
| c11 | | Chaitanya Swamy, David B. Shmoys: Sampling-based Approximation Algorithms for Multi-stage Stochastic. FOCS 2005: 357-366 |
| c10 | | |
| c9 | | Ara Hayrapetyan, Chaitanya Swamy, Éva Tardos: Network design for information networks. SODA 2005: 933-942 |
| 2004 | ||
| j1 | | Chaitanya Swamy, Amit Kumar: Primal-Dual Algorithms for Connected Facility Location Problems. Algorithmica 40(4): 245-269 (2004) |
| c8 | | David B. Shmoys, Chaitanya Swamy: Stochastic Optimization is (Almost) as easy as Deterministic Optimization. FOCS 2004: 228-237 |
| c7 | | |
| c6 | | Retsef Levi, David B. Shmoys, Chaitanya Swamy: LP-based Approximation Algorithms for Capacitated Facility Location. IPCO 2004: 206-218 |
| c5 | | Chaitanya Swamy: Correlation Clustering: maximizing agreements via semidefinite programming. SODA 2004: 526-527 |
| c4 | | David B. Shmoys, Chaitanya Swamy, Retsef Levi: Facility location with Service Installation Costs. SODA 2004: 1088-1097 |
| 2003 | ||
| c3 | | |
| 2002 | ||
| c2 | | Chaitanya Swamy, Amit Kumar: Primal-Dual Algorithms for Connected Facility Location Problems. APPROX 2002: 256-270 |
| 1999 | ||
| c1 | | Naveen Garg, Sachin Jain, Chaitanya Swamy: A Randomized Algorithm for Flow Shop Scheduling. FSTTCS 1999: 213-218 |
Colors in the list of coauthors
Last update Sat May 25 02:37:44 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page