Approximating Layout Problems on Random Geometric Graphs

Josep Dı́az, Mathew D. Penrose, Jordi Petit, Marı́a Serna
2001 Journal of Algorithms  
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
more » ... etric graphs. Afterwards, we compute lower bounds that hold, almost surely, for random geometric graphs. Then, we present two heuristics that, almost surely, turn to be constant approximation algorithms for our layout problems on random geometric graphs. In fact, for the Bandwidth and Vertex Separation problems, these heuristics are asymptotically optimal. Finally, we use the theoretical results in order to empirically compare these and other well-known heuristics. Problem Negative results Positive results MinLA NP-C [31] P for trees, hypercubes, meshes [71, 34, 59, 54] NP-C for bipartite graphs [30] NC for trees [19] O (log n) approximable [69] O (log log n) approx. for planar graphs [69] PTAS for dense graphs [5] SumCut NP-C [30] P for trees [23] NC for trees [23] Bandwidth NP-C [62] APX for certain trees [33] NP-C for trees ∆ = 3 [29], APX for dense graphs [46] caterpillars with hair length 3 [55] no PTAS for trees [9] no APX in general [45] Cutwidth NP-C [32] P for trees [75] NP-C for pl. graphs ∆ = 3 [57] NC for trees [19] APX for dense graphs [5] VertSep NP-C [52] P for trees [28] NP-C for pl. graphs ∆ = 3 [57] EdgeBis NP-C [31] P for trees (ref. in [15]) P for grid graphs without holes [64] PTAS for planar graphs [15] NCAS for planar graphs [26] P Solvable in polynomial time. APX Approximation algorithm in polynomial time. NP Solvable in non-deterministic polynomial time. PTAS Has an approximation scheme in polynomial time. NP-C NP-complete. NCAS Has an NC approximation scheme. NC Solvable in polylog time with a polynomial number of processors.
doi:10.1006/jagm.2000.1149 fatcat:wdg35yxeaffsjdut3m27klujle