"Approximation Hardness of the Steiner Tree Problem on Graphs."

Miroslav Chlebík, Janka Chlebíková (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-45471-3_18

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/swat/ChlebikC02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/swat/ChlebikC02
Miroslav Chlebík, Janka Chlebíková:
Approximation Hardness of the Steiner Tree Problem on Graphs. SWAT 2002: 170-179

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.