Stabbing Line Segments with Disks: Complexity and Approximation Algorithms

@inproceedings{Kobylkin2017StabbingLS,
  title={Stabbing Line Segments with Disks: Complexity and Approximation Algorithms},
  author={Konstantin Kobylkin},
  booktitle={AIST},
  year={2017}
}
  • K. Kobylkin
  • Published in AIST 27 July 2017
  • Mathematics, Computer Science
Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii \(r>0\) where the set of segments forms a straight line drawing \(G=(V,E)\) of a planar graph without edge crossings. Close geometric problems arise in network security applications. We give strong NP-hardness of the problem for edge sets of Delaunay triangulations, Gabriel graphs and other subgraphs (which are often… 
2 Citations

Efficient constant factor approximation algorithms for stabbing line segments with equal disks

Fast constant factor approximation algorithms are devised for a problem of intersecting a set of straight line segments with the smallest cardinality set of disks of fixed radii $r>0,$ where the set

On Covering Segments with Unit Intervals

This work studies the problem of covering a set of segments on a line with the minimum number of unit-length intervals, and shows that the restrictions of the aforementioned problems to the set of instances in which all the segments have the same length are NP-hard.

References

SHOWING 1-10 OF 23 REFERENCES

Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling

We describe two deterministic algorithms for constructing the arrangement determined by a set of (algebraic) curve segments in the plane. They both use a divide-and-conquer approach based on

Efficient Approximation Schemes for Geometric Problems?

It is shown that Maximum Independent Set is W[1]-complete for the intersection graphs of unit disks and axis-parallel unit squares in the plane and that the time PTAS of Hunt et al.

Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces

The main contribution is to show that these graphs are exactly the TD-Delaunay graphs, and are strongly connected to the geodesic embeddings of orthogonal surfaces of coplanar points in the 3D Euclidean space.

Competitive Online Routing on Delaunay Triangulations

The sequence of adjacent nodes (graph walk) visited by a routing algorithm on a graph G between given source and target nodes s and t is a c-competitive route if its length in G is at most c times

Planar grid embedding in linear time

A new algorithm is presented that runs in O(n) time and produces grid embeddings with the following properties: the total number of bends is at most 2.4n+2; the number of bending along each edge is at least 4; the length of every edge is O( n); and the area of the embedding is O (n/sup 2/).

Optimal algorithms for some intersection radius problems

The prune-and-search technique, coupled with the strategy of replacing a ray by a point or a line can be used to solve, in linear time, the intersection radius problem for a set of line segments in the plane.

Face Covers and the Genus Problem for Apex Graphs

  • B. Mohar
  • Mathematics
    J. Comb. Theory, Ser. B
  • 2001
The main result is the linear lower bound g ( G )⩾ τ /160 (if G − w is 3-connected and τ >1) and it is proved that the minimum face cover problem is NP -hard for planar triangulations and the minimum vertex cover is NP-hard for 2-connected cubic planar graphs.