Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications (Algorithms and Combinatorics, 29)
I will be using this book for:

Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications (Algorithms and Combinatorics, 29)

by Marcus Brazil, Martin Zachariasen

Algorithms Optimization Combinatorics
1 Star 2 Star 3 Star 4 Star 5 Star
0.0 out of 5 stars (0 ratings)

Marcus Brazil and Martin Zachariasen present a focused treatment of optimal interconnection trees in the plane. Combining theory, algorithms, and applications, this volume explores the mathematical and computational aspects of planar interconnection-tree problems for readers interested in algorithms, combinatorics, and geometric optimization.

About This Book

Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications examines the study of interconnection trees within planar settings.

Written by Marcus Brazil and Martin Zachariasen, the book combines theoretical discussion with algorithmic approaches.

Its coverage connects mathematical foundations to computational methods and practical applications.

Part of the Algorithms and Combinatorics series, this volume is intended for readers seeking a focused reference on planar interconnection-tree problems.

Reviews

No reviews yet. Be the first to review this book!


Write a Review
I will be using this book for: