Algorithms to Approximate Column-sparse Packing Problems

DOI10.1145/3355400zbMath1454.68176arXiv1711.02724OpenAlexW2986071419WikidataQ126808220 ScholiaQ126808220MaRDI QIDQ4973058

Aravind Srinivasan, Karthik Abinav Sankararaman, Pan Xu, Brian Brubach

Publication date: 2 December 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.02724

zbMATH Keywords

approximation algorithmsrandomized algorithmspacking programs

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture ⋮ Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations

This page was built for publication: Algorithms to Approximate Column-sparse Packing Problems