Skip to main content
SpringerLink
Log in

Reconfiguration of Multisets with Applications to Bin Packing

  • Conference paper
  • First Online:
WALCOM: Algorithms and Computation (WALCOM 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14549))

Included in the following conference series:

Abstract

We use the reconfiguration framework to analyze problems that involve the rearrangement of items among groups. In various applications, a group of items could correspond to the files or jobs assigned to a particular machine, and the goal of rearrangement could be improving efficiency or increasing locality.

To cover problems arising in a wide range of application areas, we define the general Repacking problem as the rearrangement of multisets of multisets. We present hardness results for the general case and algorithms for various classes of instances that arise in real-life scenarios. By limiting the total size of items in each multiset, our results can be viewed as an offline approach to Bin Packing, in which each bin is represented as a multiset.

In addition to providing the first results on reconfiguration of multisets, our contributions open up several research avenues: the interplay between reconfiguration and online algorithms and parallel algorithms; the use of the tools of linear programming in reconfiguration; and, in the longer term, a focus on resources in reconfiguration.

Research supported by the Natural Sciences and Engineering Research Council of Canada (NSERC).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Minimum-cost flow problems. In: Combinatorial Optimization, chap. 4, pp. 91–126. Wiley (1997). https://doi.org/10.1002/9781118033142.ch4

  2. VMWare Docs: Migrating virtual machines (2021). https://docs.vmware.com/en/VMware-vSphere/7.0/com.vmware.vsphere.vcenterhost.doc/GUID-FE2B516E-7366-4978-B75C-64BF0AC676EB.html. Accessed 28 Sept 2023

  3. Eisenbrand, F.: Fast integer programming in fixed dimension. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 196–207. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39658-1_20

    Chapter  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)

    Google Scholar 

  5. Graham, R.L.: Bounds on multiprocessing timing anomalies. J. SIAM Appl. Math. 17(2), 416–429 (1969)

    Article  MathSciNet  Google Scholar 

  6. van den Heuvel, J.: The complexity of change. In: Surveys in Combinatorics 2013. London Mathematical Society Lecture Note Series, pp. 127–160. Cambridge University Press (2013). https://doi.org/10.1017/CBO9781139506748.005

  7. Ito, T., Demaine, E.D.: Erratum to “approximability of the subset sum reconfiguration problem”. http://www.dais.is.tohoku.ac.jp/take/erratum_subsetsumreconf.pdf. Accessed 15 Nov 2023

  8. Ito, T., Demaine, E.D.: Approximability of the subset sum reconfiguration problem. J. Comb. Optim. 28(3), 639–654 (2014)

    Article  MathSciNet  Google Scholar 

  9. Ito, T., et al.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12–14), 1054–1065 (2011). https://doi.org/10.1016/j.tcs.2010.12.005

    Article  MathSciNet  Google Scholar 

  10. Korte, B., Vygen, J.: Minimum cost flows. In: Korte, B., Vygen, J. (eds.) Combinatorial Optimization. AC, vol. 21, pp. 215–244. Springer, Heidelberg (2018). https://doi.org/10.1007/978-3-662-56039-6_9

    Chapter  Google Scholar 

  11. Medina, V., García, J.M.: A survey of migration mechanisms of virtual machines. ACM Comput. Surv. 46(3), 30:1–30:33 (2014)

    Google Scholar 

  12. Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4) (2018). https://www.mdpi.com/1999-4893/11/4/52

Download references

Author information

Authors and Affiliations

  1. University of Waterloo, Waterloo, ON, Canada

    Jeffrey Kam & Naomi Nishimura

  2. York University, Toronto, ON, Canada

    Shahin Kamali

  3. University of Manitoba, Winnipeg, MB, Canada

    Avery Miller

Authors
  1. Jeffrey Kam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shahin Kamali
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Avery Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Naomi Nishimura
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Avery Miller .

Editor information

Editors and Affiliations

  1. Japan Advanced Institute of Science and Technology, Nomi, Japan

    Ryuhei Uehara

  2. Iwate University, Morioka, Japan

    Katsuhisa Yamanaka

  3. National Taiwan University, Taipei, Taiwan

    Hsu-Chun Yen

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kam, J., Kamali, S., Miller, A., Nishimura, N. (2024). Reconfiguration of Multisets with Applications to Bin Packing. In: Uehara, R., Yamanaka, K., Yen, HC. (eds) WALCOM: Algorithms and Computation. WALCOM 2024. Lecture Notes in Computer Science, vol 14549. Springer, Singapore. https://doi.org/10.1007/978-981-97-0566-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-0566-5_16

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-0565-8

  • Online ISBN: 978-981-97-0566-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation