On data reduction for dynamic vector bin packing

被引:1
|
作者
van Bevern, Rene [1 ]
Melnikov, Andrey [1 ]
Smirnov, Pavel V. [1 ]
Tsidulko, Oxana Yu. [1 ]
机构
[1] Huawei Technol Co Ltd, Novosibirsk, Russia
关键词
Approximation & amp; heuristics; Parameterized complexity; Lossy kernelization; Resource allocation; N;
D O I
10.1016/j.orl.2023.06.005
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We study a dynamic vector bin packing (DVBP) problem. We show hardness for shrinking arbitrary DVBP instances to size polynomial in the number of request types or in the maximal number of requests overlapping in time. We also present a simple polynomial-time data reduction algorithm that allows to recover (1 + & epsilon;)-approximate solutions for arbitrary & epsilon; > 0. It shrinks instances from Microsoft Azure and Huawei Cloud by an order of magnitude for & epsilon; = 0.02.& COPY; 2023 Elsevier B.V. All rights reserved.
引用
收藏
页码:446 / 452
页数:7
相关论文
共 50 条
  • [31] Optimal Data Reduction of Training Data in Machine Learning-Based Modelling: A Multidimensional Bin Packing Approach
    Wibbeke, Jelke
    Teimourzadeh Baboli, Payam
    Rohjans, Sebastian
    ENERGIES, 2022, 15 (09)
  • [32] Bin packing using semi-ordinal data
    Liu, WP
    Sidney, JB
    OPERATIONS RESEARCH LETTERS, 1996, 19 (03) : 101 - 104
  • [33] Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding
    Kulik, Ariel
    Mnich, Matthias
    Shachnai, Hadas
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 1366 - 1376
  • [34] Vector bin packing with heterogeneous bins: application to the machine reassignment problem
    Michaël Gabay
    Sofia Zaourar
    Annals of Operations Research, 2016, 242 : 161 - 194
  • [35] Comparison of Different Grasp Algorithms for The Heterogeneous Vector Bin Packing Problem
    Stakic, Dorde
    Anokic, Ana
    Jovanovic, Raka
    2019 CHINA-QATAR INTERNATIONAL WORKSHOP ON ARTIFICIAL INTELLIGENCE AND APPLICATIONS TO INTELLIGENT MANUFACTURING (AIAIM), 2019, : 63 - 70
  • [36] Vector bin packing with heterogeneous bins: application to the machine reassignment problem
    Gabay, Michael
    Zaourar, Sofia
    ANNALS OF OPERATIONS RESEARCH, 2016, 242 (01) : 161 - 194
  • [37] Competitiveness of Dynamic Bin Packing for Online Cloud Server Allocation
    Ren, Runtian
    Tang, Xueyan
    Li, Yusen
    Cai, Wentong
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (03) : 1324 - 1331
  • [38] Brief Announcement: Tight bounds for Dynamic Bin Packing with Predictions
    Liu, Mozhengfu
    Tang, Xueyan
    PROCEEDINGS OF THE 36TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2024, 2024, : 297 - 299
  • [39] Dynamic Bin Packing for On-Demand Cloud Resource Allocation
    Li, Yusen
    Tang, Xueyan
    Cai, Wentong
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (01) : 157 - 170
  • [40] An 8/3 Lower Bound for Online Dynamic Bin Packing
    Wong, Prudence W. H.
    Yung, Fencol C. C.
    Burcea, Mihai
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 44 - 53