Keyword: minimum spanning trees

Found 37 papers in total
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
2013,
This paper studies the sum‐of‐ratios version of the classical minimum...
Spanning 3‐connected index of graphs
Spanning 3‐connected index of graphs
2014,
For an integer s > 0 and for u , v ∈ V ( G ) with u ≠ v , an ( s ; u , v...
On some geometric problems of color‐spanning sets
On some geometric problems of color‐spanning sets
2013,
In this paper we study several geometric problems of color‐spanning sets: given...
New formulations of the Hop‐Constrained Minimum Spanning Tree problem via Miller–Tucker–Zemlin constraints
New formulations of the Hop‐Constrained Minimum Spanning Tree problem via Miller–Tucker–Zemlin constraints
2011,
Given an undirected network with positive edge costs and a natural number p , the...
The (K,k) ‐capacitated spanning tree problem
The (K,k) ‐capacitated spanning tree problem
2012,
This paper considers a generalization of the capacitated spanning tree problem, in...
The k‐in‐a‐Path Problem for Claw‐free Graphs
The k‐in‐a‐Path Problem for Claw‐free Graphs
2012,
The k ‐ in‐a‐Path problem is to test whether a graph contains an...
An application of the minimal spanning tree approach to the cluster stability problem
An application of the minimal spanning tree approach to the cluster stability problem
2012,
Among the areas of data and text mining which are employed today in OR, science,...
Sharp Separation and Applications to Exact and Parameterized Algorithms
Sharp Separation and Applications to Exact and Parameterized Algorithms
2012,
Many divide‐and‐conquer algorithms employ the fact that the vertex set...
The Stackelberg Minimum Spanning Tree Game
The Stackelberg Minimum Spanning Tree Game
2011,
We consider a one‐round two‐player network pricing game, the Stackelberg...
RAMP for the capacitated minimum spanning tree problem
RAMP for the capacitated minimum spanning tree problem
2010,
This paper introduces dual and primal-dual RAMP algorithms for the solution of the...
Heuristics for the central tree problem
Heuristics for the central tree problem
2010,
This paper addresses the central spanning tree problem (CTP). The problem consists in...
Reduction of ultrametric minimum cost spanning tree games to cost allocation games on rooted trees
Reduction of ultrametric minimum cost spanning tree games to cost allocation games on rooted trees
2010,
A minimum cost spanning tree game is called ultrametric if the cost function on the...
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation
2010,
This article deals with the two-stage stochastic model, which aims at explicitly...
A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
2009,
In this paper, we consider spanning tree situations, where players want to be...
Opportune moment strategies for a cost spanning tree game
Opportune moment strategies for a cost spanning tree game
2009,
Cost spanning tree problems concern the construction of a tree which provides a...
Constrained inverse min–max spanning tree problems under the weighted Hamming distance
Constrained inverse min–max spanning tree problems under the weighted Hamming distance
2009,
In this paper, we consider the constrained inverse min–max spanning tree...
Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
2005,
We present an exact algorithm for solving the generalized minimum spanning tree...
The minimum global height spanning tree and related problems
The minimum global height spanning tree and related problems
2002,
Two optimization problems are concerned in this paper, i.e. the minimum global height...
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
2003,
We formulate and computationally test several models for the Diameter-Constrained...
A capacity expansion problem with budget constraint and bottleneck limitation
A capacity expansion problem with budget constraint and bottleneck limitation
2001,
This paper considers a capacity expansion problem with a budget constraint. Suppose...
Reconstructing a minimum spanning tree after deletion of any node
Reconstructing a minimum spanning tree after deletion of any node
2001,
Updating a minimum spanning tree (MST) is a basic problem for communication networks....
The full-degree spanning tree problem
The full-degree spanning tree problem
2000,
The full-degree spanning tree problem is defined as follows: Given a connected graph G...
State space partition algorithms for stochastic systems with applications to minimum spanning trees
State space partition algorithms for stochastic systems with applications to minimum spanning trees
2000,
We investigated state space partition methods for computing probability measures...
A note on genetic algorithms for degree-constrained spanning tree problems
A note on genetic algorithms for degree-constrained spanning tree problems
1997,
The degree-constrained spanning tree problem is of high practical importance. Up to...
Papers per page: