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}
}
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… 

Balanced cut approximation in random geometric graphs

Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs

This paper presents a constant factor approximation algorithm for the Minimum Geometric Mean Layout (MGML) problem for bounded-degree planar graphs and derives an upper bound for any layout of the MGML problem.

Experiments on the minimum linear arrangement problem

  • Jordi Petit
  • Computer Science
    ACM J. Exp. Algorithmics
  • 2003
This paper experimentally compares several algorithms to obtain upper and lower bounds for the Minimum Linear Arrangement problem and finds that the best approximations are usually obtained using Simulated Annealing, which involves a large amount of computation time.

Computing subgraph probability of random geometric graphs with applications in quantitative analysis of ad hoc networks

  • Chang-Wu Yu
  • Computer Science, Mathematics
    IEEE Journal on Selected Areas in Communications
  • 2009
This work presents the first paradigm to compute the subgraph probability of RGGs in a systematical way and the closed-form formulas derived herein are fairly accurate and of practical value.

Large independent sets in general random intersection graphs

The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs

A new model for random intersection graphs is proposed which includes the model of [10] (the “uniform” random intersection graph model) as an important special case and three algorithms are proposed and analysed for the efficient construction of large independent sets in this model.

Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs

A linear-time algorithm is given to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class, and it is shown that cutwidth is NP-complete on split graphs, and consequently also on chordal graphs.

On Cutwidth Parameterized by Vertex Cover

This work gives the first non-trivial exact exponential time algorithm for Cutwidth on a graph class where the problem remains NP-complete and shows that Cutwidth parameterized by the size of the minimum vertex cover of the input graph does not admit a polynomial kernel unless NP⊆coNP/poly.

Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs

This work gives an expected polynomial time algorithm for the case p = constant and m=nα, α>1 and shows that the greedy approach still works well even in the case $m = o({{n}\over{{\rm log}n}})$ and p just above the connectivity threshold of Gn, m, p.

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

This work presents the first polynomial-time algorithm for computing the cutwidth of bipartite permutation graphs and stresses that the cut width problem is NP-complete on bipartITE graphs and its computational complexity is open even on small subclasses of permutations graphs, such as trivially perfect graphs.
...

References

SHOWING 1-10 OF 70 REFERENCES

Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs

The main results are convergence theorems that can be viewed as an analogue of the Beardwood, Halton and Hammersley theorem for the Euclidean TSP on random points in the unit square.

Algorithmic aspects of constrained unit disk graphs

The real contribution of this research is the elucidation of when and where geometry can be exploited in the development of efficient graph theoretic algorithms.

Optimal linear labelings and eigenvalues of graphs

NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs

The approximation schemes for hierarchically specified unit disk graphs presented in this paper are among the first approximation schemes in the literature for natural PSPACE-hard optimization problems.

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

Abstract.We present a randomized procedure for rounding fractional perfect matchings to (integral) matchings. If the original fractional matching satisfies any linear inequality, then with high

Unit disk graphs

Partitioning Planar Graphs

The main result of this paper is an algorithm that finds an optimal s-partition in time $O(b^2 n^3 2^{4.5b} )$, where b is the number of edges cut by an ideal s- partition.

Some Simplified NP-Complete Graph Problems

Layout Problems on Lattice Graphs

A convergence theorem for the optimal cost of the Minimum Linear Arrangement problem and the Minimum Sum Cut problem, for the case where the underlying graph is obtained through a subcritical site percolation process, can be viewed as an analogue of the Beardwood, Halton and Hammersley theorem forThe Euclidian TSP.

Vertex ordering and partitioning problems for random spatial graphs

Given an ordering of the vertices of a finite graph, let the induced weight for an edge be the separation of its endpoints in the ordering. Layout problems involve choosing the ordering to minimize a
...