
The Parameterized Complexity of Finding Minimum Bounded Chains
Finding the smallest dchain with a specific (d1)boundary in a simplic...
read it

On the Shortest Separating Cycle
According to a result of Arkin (2016), given n point pairs in the plane...
read it

Is a Finite Intersection of Balls Covered by a Finite Union of Balls in Euclidean Spaces ?
Considering a finite intersection of balls and a finite union of other b...
read it

A 1.5Approximation for Path TSP
We present a 1.5approximation for the Metric Path Traveling Salesman Pr...
read it

An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem
We study the incremental knapsack problem, where one wishes to sequentia...
read it

A New Family of Tractable Ising Models
We present a new family of zerofield Ising models over N binary variabl...
read it

The kpath coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing
In this paper, we investigate the kpath coloring problem, a variant of ...
read it
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem
We study the generalized minimum Manhattan network (GMMN) problem: given a set P of pairs of two points in the Euclidean plane R^2, we are required to find a minimumlength geometric network which consists of axisaligned segments and contains a shortest path in the L_1 metric (a socalled Manhattan path) for each pair in P. This problem commonly generalizes several NPhard network design problems that admit constantfactor approximation algorithms, such as the rectilinear Steiner arborescence (RSA) problem, and it is open whether so does the GMMN problem. As a bottomup exploration, Schnizler (2015) focused on the intersection graphs of the rectangles defined by the pairs in P, and gave a polynomialtime dynamic programming algorithm for the GMMN problem whose input is restricted so that both the treewidth and the maximum degree of its intersection graph are bounded by constants. In this paper, as the first attempt to remove the degree bound, we provide a polynomialtime algorithm for the star case, and extend it to the general tree case based on an improved dynamic programming approach.
READ FULL TEXT
Comments
There are no comments yet.