Online Mixed Packing and Covering

DOI10.1137/1.9781611973105.6MaRDI QIDQ5741714zbMATH OpenOpenAlexFDO

Authors Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi, Yossi Azar

Publication date 15 May 2019

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

Full work available at URL https://authors.library.caltech.edu/66343/

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Recommendations

• Online set packing
• Online multiple-strip packing
• Online circle packing
• scientific article; zbMATH DE number 3282420
• scientific article; zbMATH DE number 3282421
• scientific article; zbMATH DE number 3342063
• scientific article; zbMATH DE number 1182895
• On-line packing with boxes of different sizes
• Online colored bin packing
• Online Square Packing

Cited in

(9)

• Online unit clustering and unit covering in higher dimensions
• Online covering with \(\ell_q\)-norm objectives and applications to network design
• scientific article; zbMATH DE number 6696496 (Why is no real title available?)
• Online primal-dual algorithms for covering and packing
• The generalization of scheduling with machine cost
• Online Buy-at-Bulk Network Design
• Online weighted degree-bounded Steiner networks via novel online mixed packing/covering
• Algorithms – ESA 2005
• Approximation and Online Algorithms

This page was built for publication: Online Mixed Packing and Covering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741714)