No. Title Author Year
1 Truly Asymptotic Lower Bounds for Online Vector Bin Packing Balogh, János et al. 2021
2 Online Bin Covering with Limited Migration Berndt, Sebastian et al. 2019
3 A New and Improved Algorithm for Online Bin Packing Balogh, János et al. 2018
4 A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs Koutecký, Martin et al. 2018
5 Online Bin Packing with Cardinality Constraints Resolved Balogh, Janos et al. 2017
6 Improved Bounds for Online Preemptive Matching Epstein, Leah et al. 2013
7 Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model Epstein, Leah et al. 2010
8 Approximating min-max k-clustering Levin, Asaf 2007
9 Tracking mobile users Epstein, Leah et al. 2005
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI