2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/114810We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphsDiscrete MathematicsData Structures and Algorithmstext