We design approximation algorithms for the vertex ordering problems MINIMUM LINEAR
ARRANGEMENT, MINIMUM CONTAINING INTERVAL GRAPH, and MINIMUM STORAGE-
TIME PRODUCT, achieving approximation factors of O√ log n log log n), O√ log n log log
n), and O√ log T log log T), respectively, the last running in time polynomial in T (T being the
sum of execution times). The technical contribution of our paper is to introduce l 22
spreading metrics"(that can be computed by semidefinite programming) as relaxations for …

We design approximation algorithms for the vertex ordering problems Minimum Linear
Arrangement, Minimum Containing Interval Graph, and Minimum Storage-Time Product,
achieving approximation factors of,, and, respectively, the last running in time polynomial in
T (T being the sum of execution times). The technical contribution of our paper is to introduce
“ℓ 22 spreading metrics”(that can be computed by semidefinite programming) as relaxations
for both undirected and directed “permutation metrics,” which are induced by permutations of …