The steiner tree packing problem in VLSI design

The Rectilinear Steiner Tree Problem is $NP$-Complete

M. R. Garey, David S. Johnson · SIAM Journal on Applied Mathematics · 1977 · 1.1K citations

Natural Sciences, Computer Science, Mathematics +12

Hierarchical Wire Routing

Michael Burstein, Richard N. Pelavin · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1983 · 287 citations

Engineering, Computer Engineering, Electrical Engineering +16

Dogleg Channel Routing is NP-Complete

Thomas G. Szymanski · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1985 · 197 citations

Engineering, Computer Engineering, Electrical Engineering +13

Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints

Martin Grötschel, Clyde Monma · SIAM Journal on Discrete Mathematics · 1990 · 144 citations

Natural Sciences, Computer Science, Mathematics +15

Packing Steiner trees: a cutting plane algorithm and computational results

Martin Grötschel, Alexander Martín, Robert Weismantel · Mathematical Programming · 1996 · 75 citations

Computing, Computer Science, Combinatorics +11