"Computing a Rectilinear Steiner Minimal Tree in n^O(sqrt(n)) Time."

Clark D. Thomborson, Linda L. Deneen, Gary M. Shute (1987)

> Home

Details and statistics

DOI: 10.1007/3-540-18099-0_44

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/paa/ThomborsonDS87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/paa/ThomborsonDS87
Clark D. Thomborson, Linda L. Deneen, Gary M. Shute:
Computing a Rectilinear Steiner Minimal Tree in n^O(sqrt(n)) Time. Parallel Algorithms and Architectures 1987: 176-183

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.