Hardness of Minimum Barrier Shrinkage and Minimum Activation Path

by   Sergio Cabello, et al.

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.



page 1

page 2

page 3

page 4


Minimum Shared-Power Edge Cut

We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC)....

Separating Colored Points with Minimum Number of Rectangles

In this paper we study the following problem: Given k disjoint sets of p...

Barrier Forming: Separating Polygonal Sets with Minimum Number of Lines

In this work, we carry out structural and algorithmic studies of a probl...

Minimum Cuts in Geometric Intersection Graphs

Let 𝒟 be a set of n disks in the plane. The disk graph G_𝒟 for 𝒟 is the ...

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

The T-tour problem is a natural generalization of TSP and Path TSP. Give...

Breaking the n^k Barrier for Minimum k-cut on Simple Graphs

In the minimum k-cut problem, we want to find the minimum number of edge...

Minimum 0-Extension Problems on Directed Metrics

For a metric μ on a finite set T, the minimum 0-extension problem 0-Ext[...
This week in AI

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