An approximation algorithm for the at least version of the generalized minimum spanning tree problem

An approximation algorithm for the at least version of the generalized minimum spanning tree problem

Show other versions (1)

We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMSTP, which consists in finding a minimum cost tree spanning at least one node from each node set of a complete graph with the nodes partitioned into a given number of node sets called clusters. We ass...

Full description

Bibliographic Details
Main Authors: Petrică C. Pop, Andrei Horvat-Marc, Corina Pop Sitar
Format: Article
Language:English
Published: Publishing House of the Romanian Academy 2006-02-01
Series:Journal of Numerical Analysis and Approximation Theory
Subjects:
approximation algorithms
minimum spanning tree
generalized minimum spanning trees
integer programming
linear relaxation
Online Access:https://ictp.acad.ro/jnaat/journal/article/view/1016

Similar Items

Similar Items