The Steiner tree problem on graphs: inapproximability results

Janka Chlebikova, M. Chlebik

Research output: Contribution to journalArticlepeer-review

262 Downloads (Pure)


The Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a given subset of the vertices (terminals). We show that it is NP-hard to approximate the Steiner tree problem within a factor 96/95. Our inapproximability results are stated in a parametric way, and explicit hardness factors would be improved automatically providing gadgets and/or expanders with better parameters.
Original languageEnglish
Pages (from-to)207-214
Number of pages8
JournalTheoretical Computer Science
Issue number3
Publication statusPublished - 31 Oct 2008


  • Steiner tree
  • graphs
  • approximation hardness


Dive into the research topics of 'The Steiner tree problem on graphs: inapproximability results'. Together they form a unique fingerprint.

Cite this