137 research outputs found
Distributed Dominating Set Approximations beyond Planar Graphs
The Minimum Dominating Set (MDS) problem is one of the most fundamental and
challenging problems in distributed computing. While it is well-known that
minimum dominating sets cannot be approximated locally on general graphs, over
the last years, there has been much progress on computing local approximations
on sparse graphs, and in particular planar graphs.
In this paper we study distributed and deterministic MDS approximation
algorithms for graph classes beyond planar graphs. In particular, we show that
existing approximation bounds for planar graphs can be lifted to bounded genus
graphs, and present (1) a local constant-time, constant-factor MDS
approximation algorithm and (2) a local -time
approximation scheme. Our main technical contribution is a new analysis of a
slightly modified variant of an existing algorithm by Lenzen et al.
Interestingly, unlike existing proofs for planar graphs, our analysis does not
rely on direct topological arguments.Comment: arXiv admin note: substantial text overlap with arXiv:1602.0299
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
We prove the following theorem. Given a planar graph and an integer ,
it is possible in polynomial time to randomly sample a subset of vertices
of with the following properties: (i) induces a subgraph of of
treewidth , and (ii) for every connected subgraph
of on at most vertices, the probability that covers the whole
vertex set of is at least , where is the number of vertices of .
Together with standard dynamic programming techniques for graphs of bounded
treewidth, this result gives a versatile technique for obtaining (randomized)
subexponential parameterized algorithms for problems on planar graphs, usually
with running time bound . The technique can be applied to problems expressible as
searching for a small, connected pattern with a prescribed property in a large
host graph, examples of such problems include Directed -Path, Weighted
-Path, Vertex Cover Local Search, and Subgraph Isomorphism, among others. Up
to this point, it was open whether these problems can be solved in
subexponential parameterized time on planar graphs, because they are not
amenable to the classic technique of bidimensionality. Furthermore, all our
results hold in fact on any class of graphs that exclude a fixed apex graph as
a minor, in particular on graphs embeddable in any fixed surface
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs
The Capacitated Vehicle Routing problem is a generalization of the Traveling Salesman problem in which a set of clients must be visited by a collection of capacitated tours. Each tour can visit at most Q clients and must start and end at a specified depot. We present the first approximation scheme for Capacitated Vehicle Routing for non-Euclidean metrics. Specifically we give a quasi-polynomial-time approximation scheme for Capacitated Vehicle Routing with fixed capacities on planar graphs. We also show how this result can be extended to bounded-genus graphs and polylogarithmic capacities, as well as to variations of the problem that include multiple depots and charging penalties for unvisited clients
The bidimensionality theory and its algorithmic applications
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.Includes bibliographical references (p. 201-219).Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter algorithms and approximation algorithms for NP- hard graph problems in broad classes of graphs. This theory applies to graph problems that are bidimensional in the sense that (1) the solution value for the k x k grid graph (and similar graphs) grows with k, typically as Q(kÂČ), and (2) the solution value goes down when contracting edges and optionally when deleting edges. Examples of such problems include feedback vertex set, vertex cover, minimum maximal matching, face cover, a series of vertex- removal parameters, dominating set, edge dominating set, r-dominating set, connected dominating set, connected edge dominating set, connected r-dominating set, and unweighted TSP tour (a walk in the graph visiting all vertices). Bidimensional problems have many structural properties; for example, any graph embeddable in a surface of bounded genus has treewidth bounded above by the square root of the problem's solution value. These properties lead to efficient-often subexponential-fixed-parameter algorithms, as well as polynomial-time approximation schemes, for many minor-closed graph classes. One type of minor-closed graph class of particular relevance has bounded local treewidth, in the sense that the treewidth of a graph is bounded above in terms of the diameter; indeed, we show that such a bound is always at most linear. The bidimensionality theory unifies and improves several previous results.(cont.) The theory is based on algorithmic and combinatorial extensions to parts of the Robertson-Seymour Graph Minor Theory, in particular initiating a parallel theory of graph contractions. The foundation of this work is the topological theory of drawings of graphs on surfaces and our results regarding the relation (the linearity) of the size of the largest grid minor in terms of treewidth in bounded-genus graphs and more generally in graphs excluding a fixed graph H as a minor. In this thesis, we also develop the algorithmic theory of vertex separators, and its relation to the embeddings of certain metric spaces. Unlike in the edge case, we show that embeddings into Lâ (and even Euclidean embeddings) are insufficient, but that the additional structure provided by many embedding theorems does suffice for our purposes. We obtain an O[sq. root( log n)] approximation for min-ratio vertex cuts in general graphs, based on a new semidefinite relaxation of the problem, and a tight analysis of the integrality gap which is shown to be [theta][sq. root(log n)]. We also prove various approximate max-flow/min-vertex- cut theorems, which in particular give a constant-factor approximation for min-ratio vertex cuts in any excluded-minor family of graphs. Previously, this was known only for planar graphs, and for general excluded-minor families the best-known ratio was O(log n). These results have a number of applications. We exhibit an O[sq. root (log n)] pseudo-approximation for finding balanced vertex separators in general graphs.(cont.) Furthermore, we obtain improved approximation ratios for treewidth: In any graph of treewidth k, we show how to find a tree decomposition of width at most O(k[sq. root(log k)]), whereas previous algorithms yielded O(k log k). For graphs excluding a fixed graph as a minor, we give a constant-factor approximation for the treewidth; this via the bidimensionality theory can be used to obtain the first polynomial-time approximation schemes for problems like minimum feedback vertex set and minimum connected dominating set in such graphs.by MohammadTaghi Hajiaghayi.Ph.D
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
The Directed Steiner Network (DSN) problem takes as input a directed
edge-weighted graph and a set of
demand pairs. The aim is to compute the cheapest network for
which there is an path for each . It is known
that this problem is notoriously hard as there is no
-approximation algorithm under Gap-ETH, even when parametrizing
the runtime by [Dinur & Manurangsi, ITCS 2018]. In light of this, we
systematically study several special cases of DSN and determine their
parameterized approximability for the parameter .
For the bi-DSN problem, the aim is to compute a planar
optimum solution in a bidirected graph , i.e., for every edge
of the reverse edge exists and has the same weight. This problem
is a generalization of several well-studied special cases. Our main result is
that this problem admits a parameterized approximation scheme (PAS) for . We
also prove that our result is tight in the sense that (a) the runtime of our
PAS cannot be significantly improved, and (b) it is unlikely that a PAS exists
for any generalization of bi-DSN, unless FPT=W[1].
One important special case of DSN is the Strongly Connected Steiner Subgraph
(SCSS) problem, for which the solution network needs to strongly
connect a given set of terminals. It has been observed before that for SCSS
a parameterized -approximation exists when parameterized by [Chitnis et
al., IPEC 2013]. We give a tight inapproximability result by showing that for
no parameterized -approximation algorithm exists under
Gap-ETH. Additionally we show that when restricting the input of SCSS to
bidirected graphs, the problem remains NP-hard but becomes FPT for
Budgeted Dominating Sets in Uncertain Graphs
We study the Budgeted Dominating Set (BDS) problem on uncertain graphs, namely, graphs with a probability distribution p associated with the edges, such that an edge e exists in the graph with probability p(e). The input to the problem consists of a vertex-weighted uncertain graph ? = (V, E, p, ?) and an integer budget (or solution size) k, and the objective is to compute a vertex set S of size k that maximizes the expected total domination (or total weight) of vertices in the closed neighborhood of S. We refer to the problem as the Probabilistic Budgeted Dominating Set (PBDS) problem. In this article, we present the following results on the complexity of the PBDS problem.
1) We show that the PBDS problem is NP-complete even when restricted to uncertain trees of diameter at most four. This is in sharp contrast with the well-known fact that the BDS problem is solvable in polynomial time in trees. We further show that PBDS is ?[1]-hard for the budget parameter k, and under the Exponential time hypothesis it cannot be solved in n^o(k) time.
2) We show that if one is willing to settle for (1-?) approximation, then there exists a PTAS for PBDS on trees. Moreover, for the scenario of uniform edge-probabilities, the problem can be solved optimally in polynomial time.
3) We consider the parameterized complexity of the PBDS problem, and show that Uni-PBDS (where all edge probabilities are identical) is ?[1]-hard for the parameter pathwidth. On the other hand, we show that it is FPT in the combined parameters of the budget k and the treewidth.
4) Finally, we extend some of our parameterized results to planar and apex-minor-free graphs.
Our first hardness proof (Thm. 1) makes use of the new problem of k-Subset ?-? Maximization (k-SPM), which we believe is of independent interest. We prove its NP-hardness by a reduction from the well-known k-SUM problem, presenting a close relationship between the two problems
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
AbstractWe improve the running time of the general algorithmic technique known as Bakerâs approach (1994) [1] on H-minor-free graphs from O(nf(|H|)) to O(f(|H|)nO(1)). The numerous applications include, e.g. a 2-approximation for coloring and PTASes for various problems such as dominating set and max-cut, where we obtain similar improvements.On classes of odd-minor-free graphs, which have gained significant attention in recent time, we obtain a similar acceleration for a variant of the structural decomposition theorem proved by Demaine et al. (2010) [20]. We use these algorithms to derive faster 2-approximations; furthermore, we present the first PTASes and subexponential FPT-algorithms for independent set and vertex cover on these graph classes using a novel dynamic programming technique.We also introduce a technique to derive (nearly) subexponential parameterized algorithms on H-minor-free graphs. Our technique applies, in particular, to problems such as Steiner tree, (directed) subgraph with a property, (directed) longest path, and (connected/independent) dominating set, on some or all proper minor-closed graph classes. We obtain as a corollary that all problems with a minor-monotone subexponential kernel and amenable to our technique can be solved in subexponential FPT-time onH-minor free graphs. This results in a general methodology for subexponential parameterized algorithms outside the framework of bidimensionality
LIPIcs, Volume 274, ESA 2023, Complete Volume
LIPIcs, Volume 274, ESA 2023, Complete Volum
- âŠ