DeepAI AI Chat
Log In Sign Up

On the minimum spanning tree problem in imprecise set-up

by   Sanjana Dey, et al.

In this article, we study the Euclidean minimum spanning tree problem in an imprecise setup. The problem is known as the Minimum Spanning Tree Problem with Neighborhoods in the literature. We study the problem where the neighborhoods are represented as non-crossing line segments. Given a set S of n disjoint line segments in IR^2, the objective is to find a minimum spanning tree (MST) that contains exactly one end-point from each segment in S and the cost of the MST is minimum among 2^n possible MSTs. We show that finding such an MST is NP-hard in general, and propose a 2α-factor approximation algorithm for the same, where α is the approximation factor of the best-known approximation algorithm to compute a minimum cost Steiner tree in an undirected graph with non-negative edge weights. As an implication of our reduction, we can show that the unrestricted version of the problem (i.e., one point must be chosen from each segment such that the cost of MST is as minimum as possible) is also NP-hard. We also propose a parameterized algorithm for the problem based on the "separability" parameter defined for segments.


page 1

page 2

page 3

page 4


Approximating bottleneck spanning trees on partitioned tuples of points

We present approximation algorithms for the following NP-hard optimizati...

Algorithmic Solutions for Maximizing Shareable Costs

This paper addresses the optimization problem to maximize the total cost...

A 5/2-Approximation Algorithm for Coloring Rooted Subtrees of a Degree 3 Tree

A rooted tree R⃗ is a rooted subtree of a tree T if the tree obtained by...

Minimum color spanning circle of imprecise points

Let R be a set of n colored imprecise points, where each point is colore...

Multi-Level Steiner Trees

In the classical Steiner tree problem, one is given an undirected, conne...

Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule

Given a connected graph on whose edges we can build roads to connect the...

Unit Perturbations in Budgeted Spanning Tree Problems

The minimum spanning tree of a graph is a well-studied structure that is...