Buscar
Mostrando ítems 1-10 de 115
Algorithms for the power-p Steiner tree problem in the Euclidean plane
(Instituto de Informática - Universidade Federal do Rio Grande do Sul, 2018)
Predicting the performance of a parallel heuristic solution for the Steiner Tree Problem
(UR. FI – INCO., 2003)
Nowadays, there is an increasing number of computer intensive applications, which exceed the capacity of a standard stand-alone computer. An alternative is to parallelize the application and run it in a cluster; there has ...
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
(ELSEVIER SCIENCE BV, 2008)
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short ...
Worst-case performance of Wong's Steiner tree heuristic
(Elsevier B.V., 2007)
A new effective mathematical programming model to design CDN topology
(Udelar.FI., 2019)
The Steiner Tree Problem is an umbrella of combinatorial optimization problems in
graphs, most of them NP-Hard, within which, the Steiner Tree Problem in graphs (STP) is
perhaps one of the most famous and widely studied. ...
A Randomized O(log N) -competitive Algorithm For The Online Connected Facility Location Problem
(SpringerNew York, 2016)
Uma Heurística Baseada Em Otimização De Colônia De Abelhas Artificial Para O Problema Da Arvore De Steiner Euclidiano
(Universidade Federal do TocantinsPalmasCiência da ComputaçãoPalmasGraduação, 2022)