Results 161 to 170 of about 128,039 (188)
Some of the next articles are maybe not open access.

The Minimum Risk Spanning Tree Problem

2007
This paper studies a spanning tree problem with interval data that finds diverse applications in network design. Given an underlying network G = (V,E), each link e ∈ E can be established by paying a cost ce ∈ [ce, ce], and accordingly takes a risk ce-ce/ce-ce of link failure. The minimum risk spanning tree (MRST) problem is to establish a spanning tree
Xujin Chen, Jie Hu, Xiaodong Hu
openaire   +1 more source

Minimum cost spanning tree problems with groups

Economic Theory, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bergantiños, Gustavo   +1 more
openaire   +2 more sources

On the Euclidean Minimum Spanning Tree Problem

Computing Letters, 2005
Given a weighted graph G(V;E), a minimum spanning tree for G can be obtained in linear time using a randomized algorithm or nearly linear time using a deterministic algorithm. Given n points in the plane, we can construct a graph with these points as nodes and an edge between every pair of nodes. The weight on any edge is the Euclidean distance between
openaire   +1 more source

Minimum spanning tree problem

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source

The Cost Constrained Minimum Label Spanning Tree and Label Constrained Minimum Spanning Tree Problems

2009
Integer Linear Programming models are presented for two generalizations of the well know Minimum Spanning Tree Problem: the "Cost Constrained Minimum Label Spanning Tree Problem" and the "Label Constrained Minimum Spanning Tree Problem". The two considered problems are NP-Hard. Metaheuristic algorithms are proposed for their solution.
M. Salari   +4 more
openaire   +1 more source

A swarm intelligence approach to the quadratic minimum spanning tree problem

Information Sciences, 2010
Shyam Sundar, Alok Singh
exaly  

Home - About - Disclaimer - Privacy