3,181 research outputs found
Approximation Algorithm for Minimum Weight -CDS Problem in Unit Disk Graph
In a wireless sensor network, the virtual backbone plays an important role.
Due to accidental damage or energy depletion, it is desirable that the virtual
backbone is fault-tolerant. A fault-tolerant virtual backbone can be modeled as
a -connected -fold dominating set (-CDS for short). In this paper,
we present a constant approximation algorithm for the minimum weight
-CDS problem in unit disk graphs under the assumption that and
are two fixed constants with . Prior to this work, constant
approximation algorithms are known for with weight and
without weight. Our result is the first constant approximation algorithm for
the -CDS problem with general and with weight. The performance
ratio is for and for ,
where is the performance ratio for the minimum weight -fold
dominating set problem and is the performance ratio for the subset
-connected subgraph problem (both problems are known to have constant
performance ratios.
Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs
Given an undirected graph on a node set and positive integers and
, a -connected -dominating set (-CDS) is defined as a subset
of such that each node in has at least neighbors in
, and a -connected subgraph is induced by . The weighted -CDS
problem is to find a minimum weight -CDS in a given node-weighted graph.
The problem is called the unweighted -CDS problem if the objective is to
minimize the cardinality of a -CDS. These problems have been actively
studied for unit disk graphs, motivated by the application of constructing a
virtual backbone in a wireless ad hoc network. However, constant-approximation
algorithms are known only for in the unweighted -CDS problem,
and for in the weighted -CDS problem. In this paper, we
consider the case in which , and we present a simple -approximation algorithm for the unweighted -CDS problem, and a
primal-dual -approximation algorithm for the weighted
-CDS problem. Both algorithms achieve constant approximation factors
when is a fixed constant
Approximation Algorithm for Minimum Weight Connected -Fold Dominating Set
Using connected dominating set (CDS) to serve as a virtual backbone in a
wireless networks can save energy and reduce interference. Since nodes may fail
due to accidental damage or energy depletion, it is desirable that the virtual
backbone has some fault-tolerance. A -connected -fold dominating set
(-CDS) of a graph is a node set such that every node in
has at least neighbors in and the subgraph of
induced by is -connected. Using -CDS can tolerate the failure of
nodes. In this paper, we study Minimum Weight -CDS
problem (-MWCDS), and present an
-approximation algorithm, where is the
maximum degree of the graph and is the Harmonic number. Notice that
there is a -approximation algorithm for the -MWCDS problem,
where is the number of nodes in the graph. Though our constant in is larger than 1.35, is replaced by . Such a replacement
enables us to obtain a -approximation for the -MWCDS
problem on unit disk graphs
Minimum Dominating Set for a Point Set in \IR^2
In this article, we consider the problem of computing minimum dominating set
for a given set of points in \IR^2. Here the objective is to find a
minimum cardinality subset of such that the union of the unit radius
disks centered at the points in covers all the points in . We first
propose a simple 4-factor and 3-factor approximation algorithms in and time respectively improving time complexities by a
factor of and respectively over the best known result
available in the literature [M. De, G.K. Das, P. Carmi and S.C. Nandy, {\it
Approximation algorithms for a variant of discrete piercing set problem for
unit disk}, Int. J. of Comp. Geom. and Appl., to appear]. Finally, we propose a
very important shifting lemma, which is of independent interest and using this
lemma we propose a -factor approximation algorithm and a PTAS for
the minimum dominating set problem.Comment: 14 pages, 8 figure
Approximation Algorithms for the Connected Sensor Cover Problem
We study the minimum connected sensor cover problem (MIN-CSC) and the
budgeted connected sensor cover (Budgeted-CSC) problem, both motivated by
important applications (e.g., reduce the communication cost among sensors) in
wireless sensor networks. In both problems, we are given a set of sensors and a
set of target points in the Euclidean plane. In MIN-CSC, our goal is to find a
set of sensors of minimum cardinality, such that all target points are covered,
and all sensors can communicate with each other (i.e., the communication graph
is connected). We obtain a constant factor approximation algorithm, assuming
that the ratio between the sensor radius and communication radius is bounded.
In Budgeted-CSC problem, our goal is to choose a set of sensors, such that
the number of targets covered by the chosen sensors is maximized and the
communication graph is connected. We also obtain a constant approximation under
the same assumption
Efficient Construction of Dominating Set in Wireless Networks
Considering a communication topology of a wireless network modeled by a graph
where an edge exists between two nodes if they are within each other's
communication range. A subset of nodes is a dominating set if each node is
either in or adjacent to some node in . Assume each node has a disparate
communication range and is associated with a positive weight, we present a
randomized algorithm to find a min-weight dominating set. Considering any
orientation of the graph where an arc exists if the node
lies in 's communication range. A subset of nodes is a strongly
dominating set if every node except has both in-neighbor(s) and
out-neighbor(s) in . We present a polynomial-time algorithm to find a
strongly dominating set of size at most times of the optimum. We
also investigate another related problem called -Coverage. Given are a set
of disks with positive weight and a set of nodes. Assume
all input nodes lie below a horizontal line and all input disks lie above
this line in the plane. The objective is to find a min-weight subset of disks such that each node is covered at least
disks in . We propose a novel two-approximation algorithm for this
problem.Comment: 8 pages, 4 figures, 2 table
A PTAS for the Weighted Unit Disk Cover Problem
We are given a set of weighted unit disks and a set of points in Euclidean
plane. The minimum weight unit disk cover (\UDC) problem asks for a subset of
disks of minimum total weight that covers all given points. \UDC\ is one of the
geometric set cover problems, which have been studied extensively for the past
two decades (for many different geometric range spaces, such as (unit) disks,
halfspaces, rectangles, triangles). It is known that the unweighted \UDC\
problem is NP-hard and admits a polynomial-time approximation scheme (PTAS).
For the weighted \UDC\ problem, several constant approximations have been
developed. However, whether the problem admits a PTAS has been an open
question. In this paper, we answer this question affirmatively by presenting
the first PTAS for \UDC. Our result implies the first PTAS for the minimum
weight dominating set problem in unit disk graphs. Combining with existing
ideas, our result can also be used to obtain the first PTAS for the maxmimum
lifetime coverage problem and an improved constant approximation ratio for the
connected dominating set problem in unit disk graphs.Comment: We fixed several typos in this version. 37 pages. 15 figure
On Pseudo-disk Hypergraphs
Let be a family of pseudo-disks in the plane, and be a finite subset
of . Consider the hypergraph whose vertices are the pseudo-disks in
and the edges are all subsets of of the form , where is a pseudo-disk in . We give an upper bound of
for the number of edges in of cardinality at most . This
generalizes a result of Buzaglo et al. (2013).
As an application of our bound, we obtain an algorithm that computes a
constant-factor approximation to the smallest _weighted_ dominating set in a
collection of pseudo-disks in the plane, in expected polynomial time.Comment: Submitted for publicatio
A Framework for ETH-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
We give an algorithmic and lower-bound framework that facilitates the
construction of subexponential algorithms and matching conditional complexity
bounds. It can be applied to a wide range of geometric intersection graphs
(intersections of similarly sized fat objects), yielding algorithms with
running time for any fixed dimension for many
well known graph problems, including Independent Set, -Dominating Set for
constant , and Steiner Tree. For most problems, we get improved running
times compared to prior work; in some cases, we give the first known
subexponential algorithm in geometric intersection graphs. Additionally, most
of the obtained algorithms work on the graph itself, i.e., do not require any
geometric information. Our algorithmic framework is based on a weighted
separator theorem and various treewidth techniques. The lower bound framework
is based on a constructive embedding of graphs into d-dimensional grids, and it
allows us to derive matching lower bounds under the
Exponential Time Hypothesis even in the much more restricted class of
-dimensional induced grid graphs.Comment: 37 pages, full version of STOC 2018 paper; v2 updates the title and
fixes some typo
Approximation Algorithms for Dominating Set in Disk Graphs
We consider the problem of finding a lowest cost dominating set in a given
disk graph containing disks. The problem has been extensively studied on
subclasses of disk graphs, yet the best known approximation for disk graphs has
remained -- a bound that is asymptotically no better than the
general case. We improve the status quo in two ways: for the unweighted case,
we show how to obtain a PTAS using the framework recently proposed
(independently)by Mustafa and Ray [SoCG 09] and by Chan and Har-Peled [SoCG
09]; for the weighted case where each input disk has an associated rational
weight with the objective of finding a minimum cost dominating set, we give a
randomized algorithm that obtains a dominating set whose weight is within a
factor of a minimum cost solution, with high probability --
the technique follows the framework proposed recently by Varadarajan [STOC 10].Comment: 12 pages, 4 figure
- …