We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in polynomial time unless P = NP. We also provide a fixed-parameter-tractable algorithm for testing whether a drawing can be compacted to a small number of rows.
@article{arxiv.1108.4705,
title = {Inapproximability of Orthogonal Compaction},
author = {Michael J. Bannister and David Eppstein and Joseph A. Simons},
journal= {arXiv preprint arXiv:1108.4705},
year = {2015}
}
Comments
Updated to the final version to appear in the Journal of Graph Algorithms and Applications