Imposing edges in Minimum Spanning Tree

12/19/2019
by   Nicolas Isoart, et al.
0

We are interested in the consequences of imposing edges in T a minimum spanning tree. We prove that the sum of the replacement costs in T of the imposed edges is a lower bounds of the additional costs. More precisely if r-cost(T,e) is the replacement cost of the edge e, we prove that if we impose a set I of nontree edges of T then ∑_e ∈ I r-cost(T,e) ≤ cost(T_e ∈ I), where I is the set of imposed edges and T_e ∈ I a minimum spanning tree containing all the edges of I.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2019

A Linear Time Algorithm for Finding Minimum Spanning Tree Replacement Edges

Given an undirected, weighted graph, the minimum spanning tree (MST) is ...
research
02/19/2020

The Tree Stabbing Number is not Monotone

Let P ⊆ℝ^2 be a set of points and T be a spanning tree of P. The stabbin...
research
03/16/2020

İnsansız Araçlarla Düzlemsel Olmayan Araçların Taranması

The importance of area coverage with unmanned vehicles, in other words, ...
research
08/02/2021

Biobjective Optimization Problems on Matroids with Binary Costs

Like most multiobjective combinatorial optimization problems, biobjectiv...
research
10/30/2020

Approximating the clustered selected-internal Steiner tree problem

Given a complete graph G=(V,E), with nonnegative edge costs, two subsets...
research
02/06/2014

A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem

Given an undirected graph with costs associated with each edge as well a...
research
07/15/2019

Noise-Stable Rigid Graphs for Euclidean Embedding

We proposed a new criterion noise-stability, which revised the classical...

Please sign up or login with your details

Forgot password? Click here to reset