The following pages link to Randomized metarounding (Q4537626):
Displaying 25 items.
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- On dependent randomized rounding algorithms (Q1306458) (← links)
- New class of 0-1 integer programs with tight approximation via linear relaxations (Q1396978) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- Stochastic makespan minimization in structured set systems (Q2118147) (← links)
- Greedy algorithms for the profit-aware social team formation problem (Q2168713) (← links)
- On fractional cut covers (Q2312658) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
- Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design (Q3449585) (← links)
- Generalized Hypergraph Matching via Iterated Packing and Local Ratio (Q3453296) (← links)
- Multicast Routing and Design of Sparse Connectors (Q3637320) (← links)
- Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
- Finding Sparse Solutions for Packing and Covering Semidefinite Programs (Q5071107) (← links)
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs (Q5075785) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- The Complexity of Contracts (Q5856150) (← links)
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← links)
