Delay Bounded Minimum Steiner Tree Algorithms for Performance-driven Routing

Delay Bounded Minimum Steiner Tree Algorithms for Performance-driven Routing
Author :
Publisher :
Total Pages : 22
Release :
ISBN-10 : UCSC:32106013466245
ISBN-13 :
Rating : 4/5 ( Downloads)

Book Synopsis Delay Bounded Minimum Steiner Tree Algorithms for Performance-driven Routing by : Jing Zhu

Download or read book Delay Bounded Minimum Steiner Tree Algorithms for Performance-driven Routing written by Jing Zhu and published by . This book was released on 1993 with total page 22 pages. Available in PDF, EPUB and Kindle. Book excerpt:


Delay Bounded Minimum Steiner Tree Algorithms for Performance-driven Routing Related Books

Delay Bounded Minimum Steiner Tree Algorithms for Performance-driven Routing
Language: en
Pages: 22
Authors: Jing Zhu
Categories: Computer algorithms
Type: BOOK - Published: 1993 - Publisher:

DOWNLOAD EBOOK

An Iterative Approach for Delay-bounded Minimum Steiner Tree Construction
Language: en
Pages: 42
Authors: Jing Zhu
Categories: Computer algorithms
Type: BOOK - Published: 1994 - Publisher:

DOWNLOAD EBOOK

Steiner Trees in Industry
Language: en
Pages: 508
Authors: Xiuzhen Cheng
Categories: Computers
Type: BOOK - Published: 2013-12-01 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This book is a collection of articles studying various Steiner tree prob lems with applications in industries, such as the design of electronic cir cuits, compu
Approximation and Online Algorithms
Language: en
Pages: 283
Authors: Evripidis Bampis
Categories: Computers
Type: BOOK - Published: 2015-04-22 - Publisher: Springer

DOWNLOAD EBOOK

This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, he
On Optimal Interconnections for VLSI
Language: en
Pages: 301
Authors: Andrew B. Kahng
Categories: Technology & Engineering
Type: BOOK - Published: 2013-04-17 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for high-performance, high-density interconnections during the global a