An improved approximation algorithm for dynamic minimum linear arrangement

DOI10.4230/LIPICS.STACS.2024.15MaRDI QIDQ6902710zbMATH OpenFDO

Authors Marcin Bienkowski, Guy Even

Publication date 10 November 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

approximation algorithmsoptimization problemsgraph problemsminimum linear arrangementdynamic variant

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 5485537 (Why is no real title available?)
• scientific article; zbMATH DE number 3584785 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7788504 (Why is no real title available?)
• An improved approximation ratio for the minimum linear arrangement problem
• Balanced graph partitioning
• Balanced partitions of trees and applications
• Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning
• Divide-and-conquer approximation algorithms via spreading metrics
• Dynamic balanced graph partitioning
• Expander flows, geometric embeddings and graph partitioning
• Geometric algorithms and combinatorial optimization
• Improved analysis of online balanced clustering
• Improved bounds for online balanced graph re-partitioning
• New Approximation Techniques for Some Linear Ordering Problems
• Partitioning graphs into balanced components
• The \(k\)-server problem
• The itinerant list update problem

This page was built for publication: An improved approximation algorithm for dynamic minimum linear arrangement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902710)