NP-hardness of the sorting buffer problem on the uniform metric-Reference-Cited by-同舟云学术

NP-hardness of the sorting buffer problem on the uniform metric

Published:2012-07 Issue:10-11 Volume:160 Page:1453-1464
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Asahiro Yuichi,Kawahara Kenichi,Miyano Eiji

Funder

Grant-in-Aid for Scientific Research

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference12 articles.

1. A. Adamaszek, A. Czumaj, M. Englert, H. Räcke, Almost tight bounds for reordering buffer management, in: Proc. STOC 2011, 2011, pp. 607–616.

2. Y. Asahiro, K. Kawahara, E. Miyano, NP-hardness of the sorting buffer problem on the uniform metric, in: Proc. the 2008 International Conference on Foundations of Computer Science, FCS08, 2008, pp. 137–143.

3. N. Avigdor-Elgrabli, Y. Rabani, An improved competitive algorithm for reordering buffer management, in: Proc. SODA 2010, 2010, pp. 13–21.

4. Exploiting locality: approximating sorting buffers;Bar-Yehuda;J. Discrete Algorithms,2007

5. H.-L. Chan, N. Megow, R. van Stee, R. Sitters, The sorting buffer problem is NP-hard, CoRR http://arxiv.org/abs/1009.4355 [abs/1009.4355], 2010.

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

1. A review of synchronization problems in parts-to-picker warehouses;European Journal of Operational Research;2023-06

2. Almost Tight Bounds for Reordering Buffer Management;SIAM Journal on Computing;2022-05-24

3. Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment;Computers & Operations Research;2021-01

4. The forgotten sons: Warehousing systems for brick-and-mortar retail chains;European Journal of Operational Research;2021-01

5. Polylogarithmic Guarantees for Generalized Reordering Buffer Management;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11