The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays-Reference-Cited by-同舟云学术

The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays

Published:2019-06-17 Issue: Volume: Page:
ISSN:
Container-title:The 31st ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Azar Yossi¹,Emek Yuval²,van Stee Rob³,Vainstein Danny⁴

Affiliation:

1. Tel-Aviv University, Tel-Aviv, Israel

2. Technion, Haifa, Israel

3. University of Siegen, Siegen, Germany

4. Tel-Aviv University, rehovot, Israel

Funder

Israel Science Foundation

ICRC Blavatnik Fund

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3323165.3323180

Reference26 articles.

1. Online bin packing with delay and holding costs

2. Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014. Parallel Algorithms for Geometric Graph Problems. In STOC. 574--583. 10.1145/2591796.2591805 Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014. Parallel Algorithms for Geometric Graph Problems. In STOC. 574--583. 10.1145/2591796.2591805

3. Min-Cost Bipartite Perfect Matching with Delays;Ashlagi Itai;APPROX/RANDOM.,2017

4. Yossi Azar Ashish Chiplunkar and Haim Kaplan. 2017. Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. In SODA. 1051--1061. Yossi Azar Ashish Chiplunkar and Haim Kaplan. 2017. Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. In SODA. 1051--1061.

5. Yossi Azar and Amit Jacob Fanani. 2018. Deterministic Min-Cost Matching with Delays. CoRR Vol. abs/1806.03708 (2018). Yossi Azar and Amit Jacob Fanani. 2018. Deterministic Min-Cost Matching with Delays. CoRR Vol. abs/1806.03708 (2018).

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Several methods of analysis for cardinality constrained bin packing;Theoretical Computer Science;2023-01

2. Open-end bin packing: New and old analysis approaches;Discrete Applied Mathematics;2022-11

3. On bin packing with clustering and bin packing with delays;Discrete Optimization;2021-08

4. Several Methods of Analysis for Cardinality Constrained Bin Packing;Approximation and Online Algorithms;2021

5. Utilization of Site-Based Simulated Ground Motions for Hazard-Targeted Seismic Demand Estimation: Application for Ordinary Bridges in Southern California;Journal of Bridge Engineering;2020-11