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

doi:10.1006/jagm.1997.0903

Journal of Algorithms

Volume 26, Issue 2, February 1998, Pages 238-274

https://doi.org/10.1006/jagm.1997.0903 Get rights and content

Abstract

We present NC-approximation schemes for a number of graph problems when restricted to geometric graphs including unit disk graphs and graphs drawn in a civilized manner. Our approximation schemes exhibit the same time versus performance trade-off as the best known approximation schemes for planar graphs. We also define the concept of λ-precision unit disk graphs and show that for such graphs the approximation schemes have a better time versus performance trade-off than the approximation schemes for arbitrary unit disk graphs. Moreover, compared to unit disk graphs, we show that for λ-precision unit disk graphs many more graph problems have efficient approximation schemes.

Our NC-approximation schemes can also be extended to obtain efficient NC-approximation schemes for several PSPACE-hard problems on unit disk graphs specified using a restricted version of the hierarchical specification language of Bentley, Ottmann, and Widmayer. 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.

References (50)

S. Arnborg et al.
Easy problems for tree-decomposable graphs
J. Algorithms
(1991)
S. Arnborg et al.
Linear-time algorithms for NP-hard problems on graphs embedded ink
Discrete Appl. Math.
(1989)
B.N. Clark et al.
Unit disk graphs
Discrete Math.
(1990)
R.J. Fowler et al.
Optimal packing and covering in the plane are NP-complete
Inform. Process. Lett.
(1981)
D.S. Hochbaum et al.
Fast approximation algorithms for a nonconvex covering problem
J. Algorithms
(1987)
T. Lengauer et al.
The correlation between the complexities of nonhierarchical and hierarchical versions of graph problems
J. Comput. System Sci.
(1992)
M.V. Marathe et al.
Hierarchically specified unit disk graphs
Theoret. Comput. Sci.
(1997)
S. R. Arikati, A. Dessmark, A. Lingas, M. V. Marathe, Approximation algorithms for maximum two-dimensional pattern...
B.S. Baker
Approximation algorithms for NP-complete problems on planar graphs
J. Assoc. Comput. Mach.
(1994)
H. Breu, D. Kirkpatrick, Unit Disk Graph Recognition is NP-hard, 93-27, Department of Computer Science, University of...

H.L. Bodlaender

Dynamic programming on graphs of bounded treewidth

Proc. 15th International Colloquium on Automata Languages and Programming (ICALP)

(1988)

J.L. Bentley et al.

The complexity of manipulating hierarchically defined sets of rectangles

Advances in Computing Research

(1983)

A. Condon et al.

Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions

Chicago J. Theoret. Comput. Sci.

(1995)

A. Condon et al.

Random debators and the hardness of approximating stochastic functions

SIAM J. Comput.

(1997)

P. Crescenzi, V. Kann, A compendium of NP-optimization problems, March...

T. Cormen et al.

Introduction to Algorithms

(1991)

S. Doddi et al.

Map labeling problems

Proc. 8th ACM-SIAM Symposium on Discrete Algorithms (SODA)

(1997)

P.G. Doyle et al.

Random Walks and Electric Networks

(1984)

J. Diaz et al.

Parallel approximation schemes for problems on planar graphs

Acta Inform.

(1996)

D. Eppstein, G. L. Miller, S. H. Teng, A deterministic linear time algorithm for geometric separators and its...

D. Eppstein, Subgraph isomorphism in planar graphs and related problems, in, Proc. 6th ACM-SIAM Symposium on Discrete...

T. Feder, D. Greene, Optimal algorithms for approximate clustering, in, 30th ACM Symposium on Theory of Computing...

M.R. Garey et al.

Computers and Intractability: A Guide to the Theory of NP-completeness

(1979)

A. Gräf, M. Stumpf, G. Weisenfels, On coloring unit disk graphs, July...

Cited by (261)

A linear-time algorithm for minimum k-hop dominating set of a cactus graph
2022, Discrete Applied Mathematics
Given a graph $G = (V, E)$ and an integer $k \geq 1$ , a $k$ -hop dominating set $D$ of $G$ is a subset of $V$ , such that, for every vertex $v \in V$ , there exists a node $u \in D$ whose distance from $v$ is at most $k$ . A $k$ -hop dominating set of minimum cardinality is called a minimum $k$ -hop dominating set. In this paper, we present a linear-time algorithm that finds a minimum $k$ -hop dominating set in cactus graphs, which improves the $O (n^{3})$ -time algorithm of Borradaile and Le (2017). To achieve this, we show that the $k$ -hop dominating set problem for unicyclic graphs reduces to the piercing circular arcs problem, and show a linear-time algorithm for piercing sorted circular arcs, which improves the best known $O (n log n)$ -time algorithm.
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
2022, Theoretical Computer Science
In a minimum general partial dominating set problem (MinGPDS), given a graph $G = (V, E)$ , a profit function $p : V \to R^{+}$ and a threshold K, the goal is to find a minimum subset of vertices $D \subseteq V$ such that the total profit of those vertices dominated by D is at least K (a vertex is dominated by D if it is either in D or has at least one neighbor in D). In a maximum general budgeted dominating set problem (MaxGBDS), given a budget B, the goal is to find a vertex set D with at most B vertices such that the total profit of those vertices dominated by D is as large as possible. We present the first parallel algorithms for MinGPDS and MaxGBDS in unit disk graphs. They both run in $O (\log n)$ rounds on $O (n)$ machines, and achieve constant approximation ratios.
A polynomial-time approximation to a minimum dominating set in a graph
2022, Theoretical Computer Science
A dominating set of a graph $G = (V, E)$ is a subset of vertices $S \subseteq V$ such that every vertex $v \in V ∖ S$ has at least one neighbor in S. Finding a dominating set with the minimum cardinality in a connected graph $G = (V, E)$ is known to be NP-hard. A polynomial-time approximation algorithm for this problem, described here, works in two stages. At the first stage a dominant set is generated by a greedy algorithm, and at the second stage this dominating set is purified (reduced). The reduction is achieved by the analysis of the flowchart of the algorithm of the first stage and a special kind of clustering of the dominating set generated at the first stage. The clustering of the dominating set naturally leads to a special kind of a spanning forest of graph G, which serves as a basis for the second purification stage. We expose some types of graphs for which the algorithm of the first stage already delivers an optimal solution and derive sufficient conditions when the overall algorithm constructs an optimal solution. We give three alternative approximation ratios for the algorithm of the first stage, two of which are expressed in terms of solely invariant problem instance parameters, and we also give one additional approximation ratio for the overall two-stage algorithm. The greedy algorithm of the first stage turned out to be essentially the same as the earlier known state-of-the-art algorithms for the set cover and dominating set problem Chvátal [6] and Parekh [31]. The second purification stage results in a significant reduction of the dominant set created at the first stage, in practice. The practical behavior of both stages was verified for randomly generated problem instances. The computational experiments emphasize the gap between a solution of Stage 1 and a solution of Stage 2.
Dispersing and grouping points on planar segments
2021, Theoretical Computer Science
Motivated by (continuous) facility location, we study the problem of dispersing and grouping points on a set of segments (of streets) in the plane. In the former problem, given a set of n disjoint line segments in the plane, we investigate the problem of computing a point on each of the n segments such that the minimum Euclidean distance between any two of these points is maximized. We prove that this 2D dispersion problem is NP-hard, in fact, it is NP-hard even if all the segments are parallel and are of unit length. This is in contrast to the polynomial solvability of the corresponding 1D problem by Li and Wang (2016), where the intervals are in 1D and are all disjoint. With this result, we also show that the Independent Set problem on Colored Linear Unit Disk Graph (meaning the convex hulls of points with the same color form disjoint line segments) remains NP-hard, and the parameterized version of it is in W[2]. In the latter problem, given a set of n disjoint line segments in the plane we study the problem of computing a point on each of the n segments such that the maximum Euclidean distance between any two of these points is minimized. We present a factor-1.1547 approximation algorithm which runs in $O (n \log n)$ time. Our results can be generalized to the Manhattan distance.
Graph Algorithms with Neutral Atom Quantum Processors
2024, arXiv
Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
2024, arXiv

View all citing articles on Scopus

^☆: A preliminary version of this paper appeared in “Proc. 2nd European Symposium on Algorithms (ESA'94) (pp. 424–435, Springer-Verlag, Berlin/New York).

^☆☆: F. P. Preparata

^†: E-mail:{hunt,ravi,djr,res}@cs.albany.edu.

^‡: Supported by NSF Grant CCR-89-03319 and CCR-94-06611.

^‖: Part of the work was done when the author was at SUNY, Albany. E-mail:[email protected]. Work supported by Department of Energy Contract W-7405-ENG-36.

^¶: E-mail:[email protected].

^§: Supported by NSF Grant CCR-90-06396.

View full text

Regular ArticleNC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs☆,☆☆

Abstract

J. Algorithms

Discrete Appl. Math.

Discrete Math.

Inform. Process. Lett.