"Time complexity of practical parallel steiner point insertion algorithms."

Daniel A. Spielman, Shang-Hua Teng, Alper Üngör (2004)

> Home

Details and statistics

DOI: 10.1145/1007912.1007953

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/spaa/SpielmanTU04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/SpielmanTU04
Daniel A. Spielman, Shang-Hua Teng, Alper Üngör:
Time complexity of practical parallel steiner point insertion algorithms. SPAA 2004: 267-268

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.