Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems

DOI10.1137/1.9781611974782.51zbMath1422.90043OpenAlexW4244924642MaRDI QIDQ4575789

Chandra Chekuri, Kent Quanrud

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.51

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A simple method for convex optimization in the oracle model ⋮ LP Relaxation and Tree Packing for Minimum $k$-Cut ⋮ Fast and Deterministic Approximations for k-Cut. ⋮ Unnamed Item