2008 |
28 | EE | Maurice Cheung,
Chaitanya Swamy:
Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply.
FOCS 2008: 35-44 |
27 | EE | Yuval Rabani,
Leonard J. Schulman,
Chaitanya Swamy:
Approximation algorithms for labeling hierarchical taxonomies.
SODA 2008: 671-680 |
26 | EE | Chaitanya Swamy,
David B. Shmoys:
Fault-tolerant facility location.
ACM Transactions on Algorithms 4(4): (2008) |
25 | EE | Chaitanya Swamy:
Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions
CoRR abs/0805.0389: (2008) |
24 | EE | John Augustine,
Sandy Irani,
Chaitanya Swamy:
Optimal Power-Down Strategies.
SIAM J. Comput. 37(5): 1499-1516 (2008) |
23 | EE | Ivan D. Baev,
Rajmohan Rajaraman,
Chaitanya Swamy:
Approximation Algorithms for Data Placement Problems.
SIAM J. Comput. 38(4): 1411-1429 (2008) |
2007 |
22 | EE | Ron Lavi,
Chaitanya Swamy:
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity.
ACM Conference on Electronic Commerce 2007: 252-261 |
21 | EE | Chaitanya Swamy,
David B. Shmoys:
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization.
Probabilistic Methods in the Design and Analysis of Algorithms 2007 |
20 | EE | Chaitanya Swamy:
The effectiveness of Stackelberg strategies and tolls for network congestion games.
SODA 2007: 1133-1142 |
19 | EE | Yogeshwer Sharma,
Chaitanya Swamy,
David P. Williamson:
Approximation algorithms for prize collecting forest problems with submodular penalty functions.
SODA 2007: 1275-1284 |
2006 |
18 | EE | Michael Langberg,
Yuval Rabani,
Chaitanya Swamy:
Approximation Algorithms for Graph Homomorphism Problems.
APPROX-RANDOM 2006: 176-187 |
17 | EE | Rafail Ostrovsky,
Yuval Rabani,
Leonard J. Schulman,
Chaitanya Swamy:
The Effectiveness of Lloyd-Type Methods for the k-Means Problem.
FOCS 2006: 165-176 |
16 | EE | Chaitanya Swamy,
David B. Shmoys:
Approximation Algorithms for 2-Stage Stochastic Optimization Problems.
FSTTCS 2006: 5-19 |
15 | EE | 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) |
14 | EE | Chaitanya Swamy,
David B. Shmoys:
Approximation algorithms for 2-stage stochastic optimization problems.
SIGACT News 37(1): 33-46 (2006) |
2005 |
13 | EE | Chaitanya Swamy,
David B. Shmoys:
Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization.
Algorithms for Optimization with Incomplete Information 2005 |
12 | EE | Chaitanya Swamy,
David B. Shmoys:
Sampling-based Approximation Algorithms for Multi-stage Stochastic.
FOCS 2005: 357-366 |
11 | EE | Ron Lavi,
Chaitanya Swamy:
Truthful and Near-Optimal Mechanism Design via Linear Programming.
FOCS 2005: 595-604 |
10 | EE | Ara Hayrapetyan,
Chaitanya Swamy,
Éva Tardos:
Network design for information networks.
SODA 2005: 933-942 |
2004 |
9 | EE | David B. Shmoys,
Chaitanya Swamy:
Stochastic Optimization is (Almost) as easy as Deterministic Optimization.
FOCS 2004: 228-237 |
8 | EE | John Augustine,
Sandy Irani,
Chaitanya Swamy:
Optimal Power-Down Strategies.
FOCS 2004: 530-539 |
7 | EE | Retsef Levi,
David B. Shmoys,
Chaitanya Swamy:
LP-based Approximation Algorithms for Capacitated Facility Location.
IPCO 2004: 206-218 |
6 | EE | David B. Shmoys,
Chaitanya Swamy,
Retsef Levi:
Facility location with Service Installation Costs.
SODA 2004: 1088-1097 |
5 | EE | Chaitanya Swamy:
Correlation Clustering: maximizing agreements via semidefinite programming.
SODA 2004: 526-527 |
4 | EE | Chaitanya Swamy,
Amit Kumar:
Primal-Dual Algorithms for Connected Facility Location Problems.
Algorithmica 40(4): 245-269 (2004) |
2003 |
3 | EE | Chaitanya Swamy,
David B. Shmoys:
Fault-tolerant facility location.
SODA 2003: 735-736 |
2002 |
2 | EE | Chaitanya Swamy,
Amit Kumar:
Primal-Dual Algorithms for Connected Facility Location Problems.
APPROX 2002: 256-270 |
1999 |
1 | EE | Naveen Garg,
Sachin Jain,
Chaitanya Swamy:
A Randomized Algorithm for Flow Shop Scheduling.
FSTTCS 1999: 213-218 |