An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement

Authors Marcin Bienkowski , Guy Even

Thumbnail PDF


  • Filesize: 0.79 MB
  • 19 pages

Document Identifiers

Author Details

Marcin Bienkowski
  • University of Wrocław, Poland
Guy Even
  • Tel Aviv University, Israel

Cite AsGet BibTex

Marcin Bienkowski and Guy Even. An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 15:1-15:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)


The dynamic offline linear arrangement problem deals with reordering n elements subject to a sequence of edge requests. The input consists of a sequence of m edges (i.e., unordered pairs of elements). The output is a sequence of permutations (i.e., bijective mapping of the elements to n equidistant points). In step t, the order of the elements is changed to the t-th permutation, and then the t-th request is served. The cost of the output consists of two parts per step: request cost and rearrangement cost. The former is the current distance between the endpoints of the request, while the latter is proportional to the number of adjacent element swaps required to move from one permutation to the consecutive permutation. The goal is to find a minimum cost solution. We present a deterministic O(log n log log n)-approximation algorithm for this problem, improving over a randomized O(log² n)-approximation by Olver et al. [Neil Olver et al., 2018]. Our algorithm is based on first solving spreading-metric LP relaxation on a time-expanded graph, applying a tree decomposition on the basis of the LP solution, and finally converting the tree decomposition to a sequence of permutations. The techniques we employ are general and have the potential to be useful for other dynamic graph optimization problems.

Subject Classification

ACM Subject Classification
  • Theory of computation → Approximation algorithms analysis
  • Minimum Linear Arrangement
  • dynamic Variant
  • Optimization Problems
  • Graph Problems
  • approximation Algorithms


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Konstantin Andreev and Harald Räcke. Balanced graph partitioning. Theory of Computing Systems, 39(6):929-939, 2006. URL:
  2. Sanjeev Arora, Satish Rao, and Umesh Vazirani. Expander flows, geometric embeddings and graph partitioning. Journal of the ACM, 56(2):5, 2009. URL:
  3. Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, and Stefan Schmid. Dynamic balanced graph partitioning. SIAM Journal on Discrete Mathematics, 34(3):1791-1812, 2020. URL:
  4. Yair Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In Proc. 37th IEEE Symp. on Foundations of Computer Science (FOCS), pages 184-193, 1996. URL:
  5. Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, and Pavel Veselý. Improved analysis of online balanced clustering. In Proc. 19th Workshop on Approximation and Online Algorithms (WAOA), pages 224-233, 2021. URL:
  6. Persi Diaconis and R. L. Graham. Spearman’s footrule as a measure of disarray. Journal of the Royal Statistical Society: Series B (Methodological), 39(2):262-268, 1977. URL:
  7. Guy Even, Joseph Naor, Satish Rao, and Baruch Schieber. Divide-and-conquer approximation algorithms via spreading metrics. Journal of the ACM, 47(4):585-616, 2000. URL:
  8. Uriel Feige and James R. Lee. An improved approximation ratio for the minimum linear arrangement problem. Information Processing Letters, 101(1):26-29, 2007. URL:
  9. Andreas Emil Feldmann and Luca Foschini. Balanced partitions of trees and applications. Algorithmica, 71(2):354-376, 2015. URL:
  10. Tobias Forner, Harald Räcke, and Stefan Schmid. Online balanced repartitioning of dynamic communication patterns in polynomial time. In 2nd Symposium on Algorithmic Principles of Computer Systems (APOCS), pages 40-54, 2021. URL:
  11. M. R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. Google Scholar
  12. Martin Grötschel, László Lovász, and Alexander Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988. Google Scholar
  13. Shouzhen Gu, Edwin Hsing-Mean Sha, Qingfeng Zhuge, Yiran Chen, and Jingtong Hu. Area and performance co-optimization for domain wall memory in application-specific embedded systems. In Proc. 52nd Annual Design Automation Conference (DAC), pages 20:1-20:6, 2015. URL:
  14. Mark D. Hansen. Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems (extended abstract). In Proc. 30th IEEE Symp. on Foundations of Computer Science (FOCS), pages 604-609, 1989. URL:
  15. Monika Henzinger, Stefan Neumann, Harald Räcke, and Stefan Schmid. Tight bounds for online graph partitioning. In Proc. 32nd ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 2799-2818, 2021. URL:
  16. Monika Henzinger, Stefan Neumann, and Stefan Schmid. Efficient distributed workload (re-)embedding. In Proc. SIGMETRICS/Performance Joint Int. Conf. on Measurement and Modeling of Computer Systems, pages 43-44, 2019. URL:
  17. Elias Koutsoupias. The k-server problem. Computer Science Review, 3(2):105-118, 2009. URL:
  18. Robert Krauthgamer. Minimum bisection. In Encyclopedia of Algorithms, pages 1294-1297. Springer, 2016. URL:
  19. Robert Krauthgamer, Joseph Naor, and Roy Schwartz. Partitioning graphs into balanced components. In Proc. 20th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 942-949, 2009. URL:
  20. Ravi Kumar and Sergei Vassilvitskii. Generalized distances between rankings. In Proc. 19th Int. World Wide Web Conference (WWW), pages 571-580, 2010. URL:
  21. Manor Mendel. Metrical task systems. In Encyclopedia of Algorithms, pages 1279-1282. Springer, 2016. URL:
  22. Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, and Leen Stougie. The itinerant list update problem. In Proc. 16th Workshop on Approximation and Online Algorithms (WAOA), pages 310-326, 2018. URL:
  23. Maciej Pacut, Mahmoud Parham, and Stefan Schmid. Brief announcement: Deterministic lower bound for dynamic balanced graph partitioning. In Proc. 39th ACM Symp. on Principles of Distributed Computing (PODC), pages 461-463, 2020. URL:
  24. Maciej Pacut, Mahmoud Parham, and Stefan Schmid. Optimal online balanced graph partitioning. In Proc. 40th IEEE Int. Conf. on Computer Communications (INFOCOM), pages 1-9, 2021. URL:
  25. Harald Räcke. Optimal hierarchical decompositions for congestion minimization in networks. In Proc. 40th ACM Symp. on Theory of Computing (STOC), pages 255-264, 2008. URL:
  26. Harald Räcke, Stefan Schmid, and Ruslan Zabrodin. Approximate dynamic balanced graph partitioning. In Proc. 34th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 401-409. ACM, 2022. URL:
  27. Rajmohan Rajaraman and Omer Wasim. Improved bounds for online balanced graph re-partitioning. In Proc. 30th European Symp. on Algorithms (ESA), pages 83:1-83:15, 2022. URL:
  28. Satish Rao and Andréa W. Richa. New approximation techniques for some linear ordering problems. SIAM Journal on Computing, 34(2):388-404, 2004. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail