10,968 research outputs found
Improved Approximation Algorithms for Steiner Connectivity Augmentation Problems
The Weighted Connectivity Augmentation Problem is the problem of augmenting
the edge-connectivity of a given graph by adding links of minimum total cost.
This work focuses on connectivity augmentation problems in the Steiner setting,
where we are not interested in the connectivity between all nodes of the graph,
but only the connectivity between a specified subset of terminals.
We consider two related settings. In the Steiner Augmentation of a Graph
problem (-SAG), we are given a -edge-connected subgraph of a graph
. The goal is to augment by including links and nodes from of
minimum cost so that the edge-connectivity between nodes of increases by 1.
In the Steiner Connectivity Augmentation Problem (-SCAP), we are given a
Steiner -edge-connected graph connecting terminals , and we seek to add
links of minimum cost to create a Steiner -edge-connected graph for .
Note that -SAG is a special case of -SCAP.
All of the above problems can be approximated to within a factor of 2 using
e.g. Jain's iterative rounding algorithm for Survivable Network Design. In this
work, we leverage the framework of Traub and Zenklusen to give a -approximation for the Steiner Ring Augmentation Problem (SRAP):
given a cycle embedded in a larger graph and
a subset of terminals , choose a subset of links of minimum cost so that has 3 pairwise edge-disjoint paths
between every pair of terminals.
We show this yields a polynomial time algorithm with approximation ratio for -SCAP. We obtain an improved approximation
guarantee of for SRAP in the case that , which
yields a -approximation for -SAG for any
Finding a Highly Connected Steiner Subgraph and its Applications
Given a (connected) undirected graph G, a set X ? V(G) and integers k and p, the Steiner Subgraph Extension problem asks whether there exists a set S ? X of at most k vertices such that G[S] is a p-edge-connected subgraph. This problem is a natural generalization of the well-studied Steiner Tree problem (set p = 1 and X to be the terminals). In this paper, we initiate the study of Steiner Subgraph Extension from the perspective of parameterized complexity and give a fixed-parameter algorithm (i.e., FPT algorithm) parameterized by k and p on graphs of bounded degeneracy (removing the assumption of bounded degeneracy results in W-hardness).
Besides being an independent advance on the parameterized complexity of network design problems, our result has natural applications. In particular, we use our result to obtain new single-exponential FPT algorithms for several vertex-deletion problems studied in the literature, where the goal is to delete a smallest set of vertices such that: (i) the resulting graph belongs to a specified hereditary graph class, and (ii) the deleted set of vertices induces a p-edge-connected subgraph of the input graph
Pruning 2-Connected Graphs
Given an edge-weighted undirected graph with a specified set of
terminals, let the emph{density} of any subgraph be the ratio of
its weight/cost to the number of terminals it contains. If is
2-connected, does it contain smaller 2-connected subgraphs of
density comparable to that of ? We answer this question in the
affirmative by giving an algorithm to emph{prune} and find such
subgraphs of any desired size, at the cost of only a logarithmic
increase in density (plus a small additive factor).
We apply the pruning techniques to give algorithms for two NP-Hard
problems on finding large 2-vertex-connected subgraphs of low cost;
no previous approximation algorithm was known for either problem. In
the kv problem, we are given an undirected graph with edge
costs and an integer ; the goal is to find a minimum-cost
2-vertex-connected subgraph of containing at least
vertices. In the bv problem, we are given the graph with edge
costs, and a budget ; the goal is to find a 2-vertex-connected
subgraph of with total edge cost at most that maximizes
the number of vertices in . We describe an
approximation for the kv problem, and a bicriteria approximation
for the bv problem that gives an
approximation, while violating the budget by a factor of at most
Approximation Algorithms for Flexible Graph Connectivity
We present approximation algorithms for several network design problems in
the model of Flexible Graph Connectivity (Adjiashvili, Hommelsheim and
M\"uhlenthaler, "Flexible Graph Connectivity", Math. Program. pp. 1-33 (2021),
and IPCO 2020: pp. 13-26).
Let , and be integers. In an instance of the
-Flexible Graph Connectivity problem, denoted -FGC, we have an
undirected connected graph , a partition of into a set of safe
edges and a set of unsafe edges , and nonnegative costs on
the edges. A subset of edges is feasible for the -FGC
problem if for any subset of unsafe edges with , the subgraph
is -edge connected. The algorithmic goal is to find a
feasible solution that minimizes . We present a
simple -approximation algorithm for the -FGC problem via a reduction
to the minimum-cost rooted -arborescence problem. This improves on the
-approximation algorithm of Adjiashvili et al. Our -approximation
algorithm for the -FGC problem extends to a -approximation
algorithm for the -FGC problem. We present a -approximation algorithm
for the -FGC problem, and an -approximation algorithm for
the -FGC problem. Finally, we improve on the result of Adjiashvili et
al. for the unweighted -FGC problem by presenting a
-approximation algorithm.
The -FGC problem is related to the well-known Capacitated
-Connected Subgraph problem (denoted Cap-k-ECSS) that arises in the area of
Capacitated Network Design. We give a -approximation
algorithm for the Cap-k-ECSS problem, where denotes the maximum
capacity of an edge.Comment: 23 pages, 1 figure, preliminary version in the Proceedings of the
41st IARCS Annual Conference on Foundations of Software Technology and
Theoretical Computer Science (FSTTCS 2021), December 15-17, (LIPIcs, Volume
213, Article No. 9, pp. 9:1-9:14), see
https://doi.org/10.4230/LIPIcs.FSTTCS.2021.9. Related manuscript:
arXiv:2102.0330
A Variant of the Maximum Weight Independent Set Problem
We study a natural extension of the Maximum Weight Independent Set Problem
(MWIS), one of the most studied optimization problems in Graph algorithms. We
are given a graph , a weight function ,
a budget function , and a positive integer .
The weight (resp. budget) of a subset of vertices is the sum of weights (resp.
budgets) of the vertices in the subset. A -budgeted independent set in
is a subset of vertices, such that no pair of vertices in that subset are
adjacent, and the budget of the subset is at most . The goal is to find a
-budgeted independent set in such that its weight is maximum among all
the -budgeted independent sets in . We refer to this problem as MWBIS.
Being a generalization of MWIS, MWBIS also has several applications in
Scheduling, Wireless networks and so on. Due to the hardness results implied
from MWIS, we study the MWBIS problem in several special classes of graphs. We
design exact algorithms for trees, forests, cycle graphs, and interval graphs.
In unweighted case we design an approximation algorithm for -claw free
graphs whose approximation ratio () is competitive with the approximation
ratio () of MWIS (unweighted). Furthermore, we extend Baker's
technique \cite{Baker83} to get a PTAS for MWBIS in planar graphs.Comment: 18 page
On the Approximability of Digraph Ordering
Given an n-vertex digraph D = (V, A) the Max-k-Ordering problem is to compute
a labeling maximizing the number of forward edges, i.e.
edges (u,v) such that (u) < (v). For different values of k, this
reduces to Maximum Acyclic Subgraph (k=n), and Max-Dicut (k=2). This work
studies the approximability of Max-k-Ordering and its generalizations,
motivated by their applications to job scheduling with soft precedence
constraints. We give an LP rounding based 2-approximation algorithm for
Max-k-Ordering for any k={2,..., n}, improving on the known
2k/(k-1)-approximation obtained via random assignment. The tightness of this
rounding is shown by proving that for any k={2,..., n} and constant
, Max-k-Ordering has an LP integrality gap of 2 -
for rounds of the
Sherali-Adams hierarchy.
A further generalization of Max-k-Ordering is the restricted maximum acyclic
subgraph problem or RMAS, where each vertex v has a finite set of allowable
labels . We prove an LP rounding based
approximation for it, improving on the
approximation recently given by Grandoni et al.
(Information Processing Letters, Vol. 115(2), Pages 182-185, 2015). In fact,
our approximation algorithm also works for a general version where the
objective counts the edges which go forward by at least a positive offset
specific to each edge.
The minimization formulation of digraph ordering is DAG edge deletion or
DED(k), which requires deleting the minimum number of edges from an n-vertex
directed acyclic graph (DAG) to remove all paths of length k. We show that
both, the LP relaxation and a local ratio approach for DED(k) yield
k-approximation for any .Comment: 21 pages, Conference version to appear in ESA 201
- …