Contacto
Cómo comprar
Entrega
Guía de compras
Optimal Interconnection Trees in the Plane
Theory, Algorithms and Applications
Inglés
136 b
Hasta 30 días para devoluciones
Clientes que también han comprado
/
Tapa blanda
58.09
€
/
Tapa dura
162.79
€
/
Tapa blanda
23.99
€
/
Tapa blanda
7.99
€
/
Tapa blanda
8.29
€
/
Tapa blanda
26.09
€
/
Tapa dura
36.69
€
/
Tapa blanda
13.89
€
/
Tapa blanda
14.19
€
/
Tapa blanda
28.19
€
/
Tapa blanda
12.59
€
This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood across a wide range of metrics and cost functions. The book makes use of this mathematical theory to develop efficient algorithms for constructing such networks, with an emphasis on exact solutions. Marcus Brazil and Martin Zachariasen focus principally on the geometric structure of optimal interconnection networks, also known as Steiner trees, in the plane. They show readers how an understanding of this structure can lead to practical exact algorithms for constructing such trees. The book also details numerous breakthroughs in this area over the past 20 years, features clearly written proofs, and is supported by 135 colour and 15 black and white figures. It will help graduate students, working mathematicians, engineers and computer scientists to understand the principles required for designing interconnection networks in the plane that are as cost efficient as possible.
Sobre el libro
Inglés
Categorías
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa dura
247.89
€
/
Tapa dura
223.89
€
/
Tapa blanda
225.39
€
/
Tapa blanda
8.39
€
/
Tapa blanda
10.69
€
/
Tapa blanda
29.89
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?