The SCEAS System
| |||||||

## Search the dblp DataBase
Chaitanya Swamy:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Chaitanya Swamy, Amit Kumar
**Primal-Dual Algorithms for Connected Facility Location Problems.**[Citation Graph (0, 0)][DBLP] APPROX, 2002, pp:256-270 [Conf] - Michael Langberg, Yuval Rabani, Chaitanya Swamy
**Approximation Algorithms for Graph Homomorphism Problems.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:176-187 [Conf] - Chaitanya Swamy, David B. Shmoys
**Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization.**[Citation Graph (0, 0)][DBLP] Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf] - John Augustine, Sandy Irani, Chaitanya Swamy
**Optimal Power-Down Strategies.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:530-539 [Conf] - Ron Lavi, Chaitanya Swamy
**Truthful and Near-Optimal Mechanism Design via Linear Programming.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:595-604 [Conf] - David B. Shmoys, Chaitanya Swamy
**Stochastic Optimization is (Almost) as easy as Deterministic Optimization.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:228-237 [Conf] - Chaitanya Swamy, David B. Shmoys
**Sampling-based Approximation Algorithms for Multi-stage Stochastic.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:357-366 [Conf] - Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy
**The Effectiveness of Lloyd-Type Methods for the k-Means Problem.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:165-176 [Conf] - Naveen Garg, Sachin Jain, Chaitanya Swamy
**A Randomized Algorithm for Flow Shop Scheduling.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1999, pp:213-218 [Conf] - Chaitanya Swamy, David B. Shmoys
**Approximation Algorithms for 2-Stage Stochastic Optimization Problems.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2006, pp:5-19 [Conf] - Retsef Levi, David B. Shmoys, Chaitanya Swamy
**LP-based Approximation Algorithms for Capacitated Facility Location.**[Citation Graph (0, 0)][DBLP] IPCO, 2004, pp:206-218 [Conf] - Ara Hayrapetyan, Chaitanya Swamy, Éva Tardos
**Network design for information networks.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:933-942 [Conf] - David B. Shmoys, Chaitanya Swamy, Retsef Levi
**Facility location with Service Installation Costs.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1088-1097 [Conf] - Chaitanya Swamy
**Correlation Clustering: maximizing agreements via semidefinite programming.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:526-527 [Conf] - Chaitanya Swamy, David B. Shmoys
**Fault-tolerant facility location.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:735-736 [Conf] - Chaitanya Swamy, Amit Kumar
**Primal-Dual Algorithms for Connected Facility Location Problems.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:40, n:4, pp:245-269 [Journal] - David B. Shmoys, Chaitanya Swamy
**An approximation scheme for stochastic linear programming and its application to stochastic integer programs.**[Citation Graph (0, 0)][DBLP] J. ACM, 2006, v:53, n:6, pp:978-1012 [Journal] - Ron Lavi, Chaitanya Swamy
**Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2007, pp:252-261 [Conf] - Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson
**Approximation algorithms for prize collecting forest problems with submodular penalty functions.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:1275-1284 [Conf] - Chaitanya Swamy
**The effectiveness of Stackelberg strategies and tolls for network congestion games.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:1133-1142 [Conf] **Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization.**[Citation Graph (, )][DBLP]**Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply.**[Citation Graph (, )][DBLP]**Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm.**[Citation Graph (, )][DBLP]**Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity.**[Citation Graph (, )][DBLP]**Approximation algorithms for labeling hierarchical taxonomies.**[Citation Graph (, )][DBLP]**Algorithms for Probabilistically-Constrained Models of Risk-Averse Stochastic Optimization with Black-Box Distributions**[Citation Graph (, )][DBLP]**Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |