Covering a tree with rooted subtrees

02/21/2019
by   Lin Chen, et al.
0

We consider the multiple traveling salesman problem on a weighted tree. In this problem there are m salesmen located at the root initially. Each of them will visit a subset of vertices and return to the root. The goal is to assign a tour to every salesman such that every vertex is visited and the longest tour among all salesmen is minimized. The problem is equivalent to the subtree cover problem, in which we cover a tree with rooted subtrees such that the weight of the maximum weighted subtree is minimized. The classical machine scheduling problem can be viewed as a special case of our problem when the given tree is a star. We observe that, the problem remains NP-hard even if tree height and edge weight are constant, and present an FPT algorithm for this problem parameterized by the largest tour length. To achieve the FPT algorithm, we show a more general result. We prove that, integer linear programming that has a tree-fold structure is in FPT, which extends the FPT result for the n-fold integer programming by Hemmecke, Onn and Romanchuk.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2019

A Constant Factor Approximation for Capacitated Min-Max Tree Cover

Given a graph G=(V,E) with non-negative real edge lengths and an integer...
research
04/20/2020

Parameterized Study of Steiner Tree on Unit Disk Graphs

We study the Steiner Tree problem on unit disk graphs. Given a n vertex ...
research
09/15/2022

On Optimal Coverage of a Tree with Multiple Robots

We study the algorithmic problem of optimally covering a tree with k mob...
research
04/22/2021

On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs

In the classical partial vertex cover problem, we are given a graph G an...
research
07/15/2019

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination

We consider the budgeted version of the classical connected dominating s...
research
12/02/2020

Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation

In this paper, we show that Bandwidth is hard for the complexity class W...
research
09/28/2017

Energy Constrained Depth First Search

Depth first search is a natural algorithmic technique for constructing a...

Please sign up or login with your details

Forgot password? Click here to reset