Optimal wire ordering and spacing in low power semiconductor design

DOI10.1007/S10107-008-0231-ZMaRDI QIDQ847831zbMATH OpenOpenAlexFDO

Authors Peter Gritzmann, Michael Ritter, Paul Zuber

Publication date 19 February 2010

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL http://mediatum.ub.tum.de/doc/1366082/document.pdf

zbMATH Keywords

Hamilton path

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 4043771
• The complexity of minimizing wire lengths in VLSI layouts
• On VLSI interconnect optimization and linear ordering problem
• Fast Optimal Design of Semiconductor Devices
• scientific article; zbMATH DE number 750011
• Circuit optimization by rewiring
• scientific article; zbMATH DE number 1983970
• scientific article; zbMATH DE number 2042654
• scientific article; zbMATH DE number 994157

Cites work

• Extreme Hamiltonian lines
• scientific article; zbMATH DE number 2062231 (Why is no real title available?)
• Integer Programming and Combinatorial Optimization
• Special cases of travelling salesman problems and heuristics
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

Cited in

(2)

• On VLSI interconnect optimization and linear ordering problem
• Using well-solvable quadratic assignment problems for VLSI interconnect applications

This page was built for publication: Optimal wire ordering and spacing in low power semiconductor design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847831)