Post date: Aug 29, 2016 4:23:33 PM
We study a new graph layout problem with applications in database storage management. We discuss the similarities and differences of the introduced problem to other linear layout problems that were studied extensively. We present approximation algorithms for general graphs and a heuristics based algorithm for trees, and a dynamic programming based solution for a further simplification of the problem on trees.