Randomized metarounding
From MaRDI portal
Publication:4537626
DOI10.1002/rsa.10033zbMath1005.90050OpenAlexW2912794399MaRDI QIDQ4537626
No author found.
Publication date: 1 July 2002
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc704036/
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (23)
Hardness and approximation results for packing Steiner trees ⋮ Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design ⋮ Generalized Hypergraph Matching via Iterated Packing and Local Ratio ⋮ Finding Sparse Solutions for Packing and Covering Semidefinite Programs ⋮ An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph ⋮ Greedy algorithms for the profit-aware social team formation problem ⋮ A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case ⋮ Thresholded covering algorithms for robust and max-min optimization ⋮ Resource time-sharing for IoT applications with deadlines ⋮ Improved approximation algorithms for directed Steiner forest ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ Iterative Packing for Demand and Hypergraph Matching ⋮ Towards more practical linear programming-based techniques for algorithmic mechanism design ⋮ On the approximability of robust network design ⋮ When LP is the cure for your matching woes: improved bounds for stochastic matchings ⋮ Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs ⋮ Multicast Routing and Design of Sparse Connectors ⋮ On fractional cut covers ⋮ The Complexity of Contracts ⋮ Algorithms as Mechanisms: The Price of Anarchy of Relax and Round ⋮ Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations ⋮ Stochastic makespan minimization in structured set systems
Cites Work
This page was built for publication: Randomized metarounding
