The minimum linear arrangement problem on proper interval graphs
<|reference_start|>The minimum linear arrangement problem on proper interval graphs: We 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 graphs<|reference_end|>
@article{safro2006the,
    title={The minimum linear arrangement problem on proper interval graphs},
    author={Ilya Safro},
    journal={arXiv preprint arXiv:cs/0608008},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0608008},
    primaryClass={cs.DM cs.DS}
}