"Efficient algorithms for the minimum shortest path Steiner arborescence ..."

Jason Cong, Andrew B. Kahng, Kwok-Shing Leung (1998)

> Home

Details and statistics

DOI: 10.1109/43.673630

access: closed

type: Journal Article

metadata version: 2020-09-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcad/CongKL98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcad/CongKL98
Jason Cong, Andrew B. Kahng, Kwok-Shing Leung:
Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(1): 24-39 (1998)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.