# Hardness of Minimum Barrier Shrinkage and Minimum Activation Path

In the Minimum Activation Path problem, we are given a graph G with edge weights w(.) and two vertices s,t of G. We want to assign a non-negative power p(v) to each vertex v of G so that the edges uv such that p(u)+p(v) is at least w(uv) contain some s-t-path, and minimize the sum of assigned powers. In the Minimum Barrier Shrinkage problem, we are given a family of disks in the plane and two points x and y lying outside the disks. The task is to shrink the disks, each one possibly by a different amount, so that we can draw an x-y curve that is disjoint from the interior of the shrunken disks, and the sum of the decreases in the radii is minimized. We show that the Minimum Activation Path and the Minimum Barrier Shrinkage problems (or, more precisely, the natural decision problems associated with them) are weakly NP-hard.

Comments

There are no comments yet.

## Authors

• 15 publications
• 4 publications
• ### Minimum Shared-Power Edge Cut

We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC)....
06/12/2018 ∙ by Sergio Cabello, et al. ∙ 0

read it

• ### Minimum Cuts in Geometric Intersection Graphs

Let 𝒟 be a set of n disks in the plane. The disk graph G_𝒟 for 𝒟 is the ...
05/02/2020 ∙ by Sergio Cabello, et al. ∙ 0

read it

• ### Improving on Best-of-Many-Christofides for T-tours

The T-tour problem is a natural generalization of TSP and Path TSP. Give...
09/21/2020 ∙ by Vera Traub, et al. ∙ 0

read it

• ### Solutions for Subset Sum Problems with Special Digraph Constraints

The subset sum problem is one of the simplest and most fundamental NP-ha...
04/09/2020 ∙ by Frank Gurski, et al. ∙ 0

read it

• ### Minimum 0-Extension Problems on Directed Metrics

For a metric μ on a finite set T, the minimum 0-extension problem 0-Ext[...
05/30/2020 ∙ by Hiroshi Hirai, et al. ∙ 0

read it

• ### Minimum-Link Rectilinear Covering Tour is NP-hard in R^4

Given a set P of n points in R^d, a tour is a closed simple path that co...
10/01/2018 ∙ by Bhadrachalam Chitturi, et al. ∙ 0

read it

• ### A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane

Given two points s and t in the plane and a set of obstacles defined by ...
11/29/2020 ∙ by Neeraj Kumar, et al. ∙ 0

read it

##### This week in AI

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