"Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs."

Ludek Kucera et al. (1986)

> Home

Details and statistics

DOI: 10.1007/BFB0016276

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/KuceraMPT86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/KuceraMPT86
Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo:
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. MFCS 1986: 501-511

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.