Optimal interconnection trees in the plane. Theory, algorithms and applications

DOI10.1007/978-3-319-13915-9zbMath1319.05044MaRDI QIDQ2339762

Marcus Brazil, Martin Zachariasen

Publication date: 7 April 2015

Published in: Algorithms and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13915-9

zbMATH Keywords

Steiner tree; exact algorithms; chip design; geometric planes; optimal interconnection networks

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

68R05: Combinatorics in computer science

90C27: Combinatorial optimization

05C10: Planar graphs; geometric and topological aspects of graph theory

68W35: Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.)

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)