Minimum Cost Spanning Tree
Mostrando 1-4 de 4 artigos, teses e dissertações.
-
1. k-árvores de custo mínimo / Minimum cost k-trees
Esta dissertação trata do problema da k-árvore de custo mínimo (kMST): dados um grafo conexo G, um custo não-negativo c_e para cada aresta e e um número inteiro positivo k, encontrar uma árvore com k vértices que tenha custo mínimo. O kMST é um problema NP-difícil e portanto não se conhece um algoritmo polinomial para resolvê-lo. Nesta disserta�
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 11/06/2010
-
2. MODELS AND ALGORITHMS FOR THE DIAMETER CONSTRAINED MINIMUM SPANNING TREE PROBLEM / MODELOS E ALGORITMOS PARA O PROBLEMA DA ÁRVORE GERADORA DE CUSTO MÍNIMO COM RESTRIÇÃO DE DIÂMETRO
In this work, models and approximation algorithms to solve the Diameter Constrained Minimum Spanning Tree Problem (AGMD) are proposed. This problem typically models network design applications where all vertices must communicate with each other at a minimum cost, while meeting a given quality requirement. The formulations proposed by Achuthan and Caccetta ar
Publicado em: 2006
-
3. An algorithm to generate all spanning trees of a graph in order of increasing cost
A minimum spanning tree of an undirected graph can be easily obtained using classical algorithms by Prim or Kruskal. A number of algorithms have been proposed to enumerate all spanning trees of an undirected graph. Good time and space complexities are the major concerns of these algorithms. Most algorithms generate spanning trees using some fundamental cut o
Pesquisa Operacional. Publicado em: 2005-08
-
4. Scaling and universality in continuous length combinatorial optimization
We consider combinatorial optimization problems defined over random ensembles and study how solution cost increases when the optimal solution undergoes a small perturbation δ. For the minimum spanning tree, the increase in cost scales as δ2. For the minimum matching and traveling salesman problems in dimension d ≥ 2, the increase scales as δ3; this is o
National Academy of Sciences.