Login / Signup
Efficient and optimal post-layout double-cut via insertion by network relaxation and min-cost maximum flow.
Lun-Chun Wei
Hung-Ming Chen
Li-Da Huang
Sarah Songjie Xu
Published in:
ACM Great Lakes Symposium on VLSI (2008)
Keyphrases
</>
maximum flow
minimum cut
network flow
min cost
flow network
minimum cost
special case
dynamic programming