Parameterized Complexity of Min-Power Asymmetric Connectivity

05/29/2020
by   Matthias Bentert, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/02/2020

Minimum 2-vertex strongly biconnected spanning directed subgraph problem

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

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

We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that...
01/05/2018

Sparse highly connected spanning subgraphs in dense directed graphs

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

Twinless articulation points and some related problems

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

Solving hard cut problems via flow-augmentation

We present a new technique for designing FPT algorithms for graph cut pr...
07/20/2017

Parameterized Approximation Algorithms for Directed Steiner Network Problems

(See paper for full abstract) Given an edge-weighted directed graph G=...
02/27/2019

Reconfiguration of Connected Graph Partitions

Motivated by recent computational models for redistricting and detection...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.