The following pages link to Chaitanya Swamy (Q662295):
Displaying 50 items.
- LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
- Primal-dual algorithms for connected facility location problems (Q1884770) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- Compact, provably-good LPs for orienteering and regret-bounded vehicle routing (Q2401157) (← links)
- MIN-MAX theorems for packing and covering odd \((u,v)\)-trails (Q2401167) (← links)
- Approximability of the firefighter problem. Computing cuts over time (Q2428668) (← links)
- Improved Approximation Guarantees for Lower-Bounded Facility Location (Q2848930) (← links)
- (Q2921761) (← links)
- (Q2934708) (← links)
- (Q2934723) (← links)
- Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players (Q2937773) (← links)
- Learning Arbitrary Statistical Mixtures of Discrete Distributions (Q2941569) (← links)
- Approximation Algorithms for Minimum-Load k-Facility Location (Q2969039) (← links)
- Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications (Q2969635) (← links)
- Welfare maximization and truthfulness in mechanism design with ordinal preferences (Q2988871) (← links)
- Learning mixtures of arbitrary distributions over large discrete domains (Q2988881) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization (Q3143299) (← links)
- The effectiveness of stackelberg strategies and tolls for network congestion games (Q3189079) (← links)
- Approximation Algorithms for Data Placement Problems (Q3395037) (← links)
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs (Q3455224) (← links)
- Optimal Power-Down Strategies (Q3532574) (← links)
- Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm (Q3569822) (← links)
- (Q3579377) (← links)
- Approximation Algorithms for Graph Homomorphism Problems (Q3595371) (← links)
- Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity (Q3652284) (← links)
- (Q4411292) (← links)
- (Q4471365) (← links)
- (Q4501673) (← links)
- Approximation Algorithms for Minimum-Load <i>k</i> -Facility Location (Q4554343) (← links)
- Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers (Q4598208) (← links)
- Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications (Q4962627) (← links)
- Fault-tolerant facility location (Q4962756) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- (Q5002699) (← links)
- (Q5009558) (← links)
- Simpler and Better Algorithms for Minimum-Norm Load Balancing (Q5075764) (← links)
- Improved Algorithms for MST and Metric-TSP Interdiction (Q5111362) (← links)
- Approximation algorithms for minimum norm and ordered optimization problems (Q5212754) (← links)
- Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions (Q5212817) (← links)
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing (Q5259610) (← links)
- Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract) (Q5362984) (← links)
- Improved Region-Growing and Combinatorial Algorithms for <i>k</i>-Route Cut Problems (Extended Abstract) (Q5363092) (← links)
- (Q5365144) (← links)
- Approximation Algorithms for 2-Stage Stochastic Optimization Problems (Q5385968) (← links)
