Tomaso Pomentale
- 1 CASE, P. W. GRAFF, H. H., GRIFFITH, L. E., LEGLERCQ, A. R., MURLEY, W. B. SPENCE, T. M. Solid logic design automation. IBM J. Res, Develop. 8 (1964), 127-140.Google Scholar
Digital Library
- 2 COOPER, L. Heuristic methods for location-allocation problems SIAM Rev. 6 (1964), 37-53.Google Scholar
- 3 KURTZBERG, J. M. On approximation methods for the assignment problem. J. ACM 9 (1962), 419-439. Google ScholarDigital Library
- 4 LEE, C. Y. An algorithm for path connections and its applications. IRE Trans. EC 10(1961), 346-353.Google ScholarCross Ref
- 5 LERDA, F., AND MAJORANI, E. An algorithm for connecting N points with a minimum number of corssings Calcolo 1 (1964) 257-265.Google Scholar
- 6 LOBERMAN, H., AND WEINBERGER, A. Formal procedure for connecting terminals with a minimum total wire length. J. ACM 4 (1957), 428-433. Google ScholarDigital Library
- 7 MAJORANI, E. Simplification of Lee's algorithm for special problems. Calcolo 1 (1964), 247-256.Google ScholarCross Ref
- 8 MUNKRES, J. Algorithms for the assignment and transportation problems. J. SIAM 5(1957), 32-38.Google Scholar
- 9 STEINBERG, L The backboard wiring problem: a placement algorithm. SIAM Rev. 3(1961), 37-50.Google ScholarDigital Library
Index Terms
- An algorithm for minimizing backboard wiring functions
Recommendations
Minimum-Area Wiring for Slicing Structures
In this paper we consider the problem of optimal wiring of VLSI circuits. The topological placement of the circuit elements (macros) on the chip is assumed to have a special hierarchical structure, i.e., to be a slicing floorplan, represented by a ...
A Hierarchical Global Wiring Algorithm for Custom Chip Design
We present a global wiring algorithm used in a top-down physical design environment, i.e., macros are laid out after global wiring is done, and wires are allowed to pass through macros (the wiring-through model). The floorplan of the chip is in the form ...
Minimizing nonconvex functions for sparse vector reconstruction
In this paper, we develop a novel methodology for minimizing a class of nonconvex (concave on the non-negative orthant) functions for solving an underdetermined linear system of equations As=x when the solution vector sis known a priori to be sparse. ...
Comments