DeepAI AI Chat
Log In Sign Up

Parameterized Complexity of Min-Power Asymmetric Connectivity

by   Matthias Bentert, et al.

We investigate parameterized algorithms for the NP-hard problem Min-Power Asymmetric Connectivity (MinPAC) that has applications in wireless sensor networks. Given a directed arc-weighted graph, MinPAC asks for a strongly connected spanning subgraph minimizing the summed vertex costs. Here, the cost of each vertex is the weight of its heaviest outgoing arc in the chosen subgraph. We present linear-time algorithms for the cases where the number of strongly connected components in a so-called obligatory subgraph or the feedback edge number in the underlying undirected graph is constant. Complementing these results, we prove that the problem is W[2]-hard with respect to the solution cost, even on restricted graphs with one feedback arc and binary arc weights.


page 1

page 2

page 3

page 4


Minimum 2-vertex strongly biconnected spanning directed subgraph problem

A directed graph G=(V,E) is strongly biconnected if G is strongly connec...

Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem

We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that...

Identifying a 3-vertex strongly biconnected directed subgraph with minimum number of edges

A strongly connected graph is strongly biconnected if after ignoring the...

Sparse highly connected spanning subgraphs in dense directed graphs

Mader (1985) proved that every strongly k-connected n-vertex digraph con...

Twinless articulation points and some related problems

Let G=(V,E) be a twinless strongly connected graph. a vertex v∈ V is a t...

Weighted Connected Matchings

A matching M is a 𝒫-matching if the subgraph induced by the endpoints of...

QCSP on Reflexive Tournaments

We give a complexity dichotomy for the Quantified Constraint Satisfactio...