Advances in Steiner Trees
Ding-Zhu Du · J.M. Smith · J. Hyam Rubinstein
jun. de 2013 · Combinatorial Optimization Livro 6 · Springer Science & Business Media
E-book
323
Páginas
reportAs notas e avaliações não são verificadas Saiba mais
Sobre este e-book
The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem.
Avaliar este e-book
Diga o que você achou
Informações de leitura
Smartphones e tablets
Instale o app Google Play Livros para Android e iPad/iPhone. Ele sincroniza automaticamente com sua conta e permite ler on-line ou off-line, o que você preferir.
Laptops e computadores
Você pode ouvir audiolivros comprados no Google Play usando o navegador da Web do seu computador.
eReaders e outros dispositivos
Para ler em dispositivos de e-ink como os e-readers Kobo, é necessário fazer o download e transferir um arquivo para o aparelho. Siga as instruções detalhadas da Central de Ajuda se quiser transferir arquivos para os e-readers compatíveis.
