A generic algorithm for one-dimensional homotopic compaction
From MaRDI portal
(Redirected from Publication:916367)
Recommendations
Cites work
- scientific article; zbMATH DE number 4039320 (Why is no real title available?)
- scientific article; zbMATH DE number 4083048 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs
- A mixed-integer linear programming problem which is efficiently solvable
- On the solution of inequality systems relevant to IC-layout
- Parity conditions in homotopic knock-knee routing
Cited in
(12)- scientific article; zbMATH DE number 4072377 (Why is no real title available?)
- New algorithms based on a multiple storage quadtree for hierarchical compaction of VLSI mask layout
- scientific article; zbMATH DE number 219272 (Why is no real title available?)
- scientific article; zbMATH DE number 3894985 (Why is no real title available?)
- A framework for 1-D compaction with forbidden region avoidance
- On counting pairs of intersecting segments and off-line triangle range searching
- Fast algorithms for one-dimensionsal compaction with jog insertion
- scientific article; zbMATH DE number 3852448 (Why is no real title available?)
- Minimizing total wire length during 1-dimensional compaction
- Parity conditions in homotopic knock-knee routing
- Single-layer cylindrical compaction
- A faster one-dimensional topological compaction algorithm with jog insertion
This page was built for publication: A generic algorithm for one-dimensional homotopic compaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q916367)