A Bicriterion Steiner Tree Problem on Graph
Mirko Vujošević, Milan Stanojević (2003)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “The color-balanced spanning tree problem”
A Bicriterion Steiner Tree Problem on Graph
Variations for spanning trees.
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
A few remarks on the history of MST-problem
Jaroslav Nešetřil (1997)
Archivum Mathematicum
Similarity:
On the background of Borůvka’s pioneering work we present a survey of the development related to the Minimum Spanning Tree Problem. We also complement the historical paper Graham-Hell [GH] by a few remarks and provide an update of the extensive literature devoted to this problem.
Independence number and degree bounded spanning tree.
Rahman, Mohammad Sohel, Kaykobad, Mohammad (2004)
Applied Mathematics E-Notes [electronic only]
Similarity:
Spanning trees with leaves bounded by independence number.
Sun, Ling-li (2007)
Applied Mathematics E-Notes [electronic only]
Similarity:
Algorithm 42. Enclosure of a point to the minimum spanning tree
G. Trybuś (1976)
Applicationes Mathematicae
Similarity:
Worst-case relative performances of heuristics for the Steiner problem in graphs.
Plesník, Ján (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.
Bar-Yehuda, Reuven, Even, Guy, Feldmann, Jon, Naor, Joseph (2001)
Journal of Graph Algorithms and Applications
Similarity:
Approximation algorithms for metric tree cover and generalized tour and tree covers
Viet Hung Nguyen (2007)
RAIRO - Operations Research
Similarity:
Given a weighted undirected graph , a tree (respectively tour) cover of an edge-weighted graph is a set of edges which forms a tree (resp. closed walk) and covers every other edge in the graph. The tree (resp. tour) cover problem is of finding a minimum weight tree (resp. tour) cover of . Arkin, Halldórsson and Hassin (1993) give approximation algorithms with factors respectively 3.5 and 5.5. Later Könemann, Konjevod, Parekh, and Sinha (2003) study the linear programming relaxations...