The following pages link to Anupam Gupta (Q403673):
Displaying 50 items.
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- Efficient cost-sharing mechanisms for prize-collecting problems (Q494320) (← links)
- Making doubling metrics geodesic (Q627522) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Cuts, trees and \(\ell_1\)-embeddings of graphs (Q705742) (← links)
- (Q818825) (redirect page) (← links)
- Building edge-failure resilient networks (Q818826) (← links)
- Approximation algorithms for the unsplittable flow problem (Q868438) (← links)
- An improved approximation algorithm for requirement cut (Q991474) (← links)
- Embedding tree metrics into low-dimensional Euclidean spaces (Q1577550) (← links)
- Stochastic makespan minimization in structured set systems (Q2118147) (← links)
- Non-adaptive stochastic score classification and explainable halfspace evaluation (Q2164705) (← links)
- Matroid-based TSP rounding for half-integral solutions (Q2164710) (← links)
- The Markovian price of information (Q2293091) (← links)
- Approximation algorithms for minimizing average distortion (Q2432527) (← links)
- Cost-sharing mechanisms for network design (Q2471805) (← links)
- On a bidirected relaxation for the MULTIWAY CUT problem (Q2565851) (← links)
- Improved Bandwidth Approximation for Trees and Chordal Graphs (Q2746436) (← links)
- (Q2768295) (← links)
- Embedding tree metrics into low dimensional Euclidean spaces (Q2819599) (← links)
- How the Experts Algorithm Can Help Solve LPs Online (Q2833109) (← links)
- The Online Metric Matching Problem for Doubling Metrics (Q2843268) (← links)
- Approximating Sparse Covering Integer Programs Online (Q2843269) (← links)
- Set Covering with Our Eyes Closed (Q2848202) (← links)
- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling (Q2848923) (← links)
- The Approximability of the Binary Paintshop Problem (Q2851858) (← links)
- Privately Releasing Conjunctions and the Statistical Query Barrier (Q2862200) (← links)
- Iterative Constructions and Private Data Release (Q2891493) (← links)
- Technical Note—Approximation Algorithms for VRP with Stochastic Demands (Q2892219) (← links)
- Approximating TSP on Metrics with Bounded Global Growth (Q2910854) (← links)
- (Q2921658) (← links)
- (Q2921660) (← links)
- (Q2921739) (← links)
- (Q2921762) (← links)
- Dial a Ride from <i>k</i> -forest (Q2930320) (← links)
- (Q2934710) (← links)
- On the Lovász Theta function for Independent Sets in Sparse Graphs (Q2941507) (← links)
- Greedy Algorithms for Steiner Forest (Q2941584) (← links)
- Catch them if you can (Q2986895) (← links)
- (Q3002765) (← links)
- (Q3096214) (← links)
- Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems (Q3115871) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- All-Norms and All-L_p-Norms Approximation Algorithms (Q3165959) (← links)
- A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems (Q3169083) (← links)
- An Improved Integrality Gap for Asymmetric TSP Paths (Q3186524) (← links)
- Set connectivity problems in undirected graphs and the directed steiner network problem (Q3189000) (← links)
- A constant factor approximation algorithm for a class of classification problems (Q3192037) (← links)
