Steiner Tree
Mostrando 1-4 de 4 artigos, teses e dissertações.
-
1. Árvores de Steiner: Teoria, Geração Numérica e Aplicações / Steiner trees: Theory, Numerical Generation and Applications
Given a set of points in the plane, which we call terminals, one proves that they are always connected by a minimal graph called Steiner tree. The terminals may represent main connection route points, circuit elements or network computer servers. That is, the problem is to optimize traffic among the terminals whenever this is represented by a tree of shortes
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 16/12/2009
-
2. Otimização no serviço de saúde no estado do Paraná: fluxo de pacientes e novas configurações hierárquicas
This paper presents a proposal for optimizing the public health service in the state of Parana in terms of the flow of patients within the state's boundaries and the regionalization (division) of the state into new hierarchical configurations for this service. In terms of regionalization, the proposal consists of dividing the state into smaller regions compr
Gestão & Produção. Publicado em: 2008-08
-
3. Aproximação e compartilhamento de custos em projeto de redes / Approximation and cost-sharing in network design
We consider the interplay of two areas: combinatorial optimization and cost-sharing in network design problems. In the first, we are interested to find a solution with small cost. In the second we would like to share the solution cost between its users. We present algorithms for the problems Connected Facility Location and Rent-or-Buy . These two problems ar
Publicado em: 2006
-
4. The Steiner ratio conjecture of Gilbert and Pollak is true.
Let P be a set of n points on the euclidean plane. Let Ls(P) and Lm(P) denote the lengths of the Steiner minimum tree and the minimum spanning tree on P, respectively. In 1968, Gilbert and Pollak conjectured that for any P, Ls(P) >/= (radical3/2)Lm(P). We provide an abridged proof for their conjecture in this paper.