Highly Influenced

# Approximating Layout Problems on Random Geometric Graphs

@article{Daz2001ApproximatingLP, title={Approximating Layout Problems on Random Geometric Graphs}, author={Josep D{\'i}az and Mathew D. Penrose and Jordi Petit and Maria J. Serna}, journal={J. Algorithms}, year={2001}, volume={39}, pages={78-116} }

- Published 2001 in J. Algorithms
DOI:10.1006/jagm.2000.1149

In this paper, we study the approximability of several layout problems on a family of random geometric graphs. Vertices of random geometric graphs are randomly distributed on the unit square and are connected by edges whenever they are closer than some given parameter. The layout problems that we consider are: Bandwidth, Minimum Linear Arrangement, Minimum Cut Width, Minimum Sum Cut, Vertex Separation and Edge Bisection. We first prove that some of these problems remain NP-complete even for… CONTINUE READING