"Buffered Steiner trees for difficult instances."

Charles J. Alpert et al. (2001)

> Home

Details and statistics

DOI: 10.1145/369691.369699

access: closed

type: Conference or Workshop Paper

metadata version: 2023-12-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ispd/AlpertHHKLLQSSV01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ispd/AlpertHHKLLQSSV01
Charles J. Alpert, Milos Hrkic, Jiang Hu, Andrew B. Kahng, John Lillis, Bao Liu, Stephen T. Quay, Sachin S. Sapatnekar, A. J. Sullivan, Paul Villarrubia:
Buffered Steiner trees for difficult instances. ISPD 2001: 4-9

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.