10,907 research outputs found
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
We study the family of intersection graphs of low density objects in low
dimensional Euclidean space. This family is quite general, and includes planar
graphs. We prove that such graphs have small separators. Next, we present
efficient -approximation algorithms for these graphs, for
Independent Set, Set Cover, and Dominating Set problems, among others. We also
prove corresponding hardness of approximation for some of these optimization
problems, providing a characterization of their intractability in terms of
density
Polychromatic Coloring for Half-Planes
We prove that for every integer , every finite set of points in the plane
can be -colored so that every half-plane that contains at least
points, also contains at least one point from every color class. We also show
that the bound is best possible. This improves the best previously known
lower and upper bounds of and respectively. We also show
that every finite set of half-planes can be colored so that if a point
belongs to a subset of at least of the half-planes then
contains a half-plane from every color class. This improves the best previously
known upper bound of . Another corollary of our first result is a new
proof of the existence of small size \eps-nets for points in the plane with
respect to half-planes.Comment: 11 pages, 5 figure
Stabbing line segments with disks: complexity and approximation algorithms
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 where the set of segments forms a straight
line drawing 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 used in network design) for and some constant where and
are Euclidean lengths of the longest and shortest graph edges
respectively. Fast -time -approximation algorithm is
proposed within the class of straight line drawings of planar graphs for which
the inequality holds uniformly for some constant
i.e. when lengths of edges of are uniformly bounded from above by
some linear function of Comment: 12 pages, 1 appendix, 15 bibliography items, 6th International
Conference on Analysis of Images, Social Networks and Texts (AIST-2017
Bidimensionality and Geometric Graphs
In this paper we use several of the key ideas from Bidimensionality to give a
new generic approach to design EPTASs and subexponential time parameterized
algorithms for problems on classes of graphs which are not minor closed, but
instead exhibit a geometric structure. In particular we present EPTASs and
subexponential time parameterized algorithms for Feedback Vertex Set, Vertex
Cover, Connected Vertex Cover, Diamond Hitting Set, on map graphs and unit disk
graphs, and for Cycle Packing and Minimum-Vertex Feedback Edge Set on unit disk
graphs. Our results are based on the recent decomposition theorems proved by
Fomin et al [SODA 2011], and our algorithms work directly on the input graph.
Thus it is not necessary to compute the geometric representations of the input
graph. To the best of our knowledge, these results are previously unknown, with
the exception of the EPTAS and a subexponential time parameterized algorithm on
unit disk graphs for Vertex Cover, which were obtained by Marx [ESA 2005] and
Alber and Fiala [J. Algorithms 2004], respectively.
We proceed to show that our approach can not be extended in its full
generality to more general classes of geometric graphs, such as intersection
graphs of unit balls in R^d, d >= 3. Specifically we prove that Feedback Vertex
Set on unit-ball graphs in R^3 neither admits PTASs unless P=NP, nor
subexponential time algorithms unless the Exponential Time Hypothesis fails.
Additionally, we show that the decomposition theorems which our approach is
based on fail for disk graphs and that therefore any extension of our results
to disk graphs would require new algorithmic ideas. On the other hand, we prove
that our EPTASs and subexponential time algorithms for Vertex Cover and
Connected Vertex Cover carry over both to disk graphs and to unit-ball graphs
in R^d for every fixed d
On the approximation of mean densities of random closed sets
Many real phenomena may be modelled as random closed sets in ,
of different Hausdorff dimensions. In many real applications, such as fiber
processes and -facets of random tessellations of dimension in
spaces of dimension , several problems are related to the estimation of
such mean densities. In order to confront such problems in the general setting
of spatially inhomogeneous processes, we suggest and analyze an approximation
of mean densities for sufficiently regular random closed sets. We show how some
known results in literature follow as particular cases. A series of examples
throughout the paper are provided to illustrate various relevant situations.Comment: Published in at http://dx.doi.org/10.3150/09-BEJ186 the Bernoulli
(http://isi.cbs.nl/bernoulli/) by the International Statistical
Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm
Constructing Intrinsic Delaunay Triangulations of Submanifolds
We describe an algorithm to construct an intrinsic Delaunay triangulation of
a smooth closed submanifold of Euclidean space. Using results established in a
companion paper on the stability of Delaunay triangulations on -generic
point sets, we establish sampling criteria which ensure that the intrinsic
Delaunay complex coincides with the restricted Delaunay complex and also with
the recently introduced tangential Delaunay complex. The algorithm generates a
point set that meets the required criteria while the tangential complex is
being constructed. In this way the computation of geodesic distances is
avoided, the runtime is only linearly dependent on the ambient dimension, and
the Delaunay complexes are guaranteed to be triangulations of the manifold
- …