scientific article; zbMATH DE number 1834686

zbMath0999.68081MaRDI QIDQ4779183

Martin Thimm

Publication date: 25 November 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360678

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundsminimum Steiner treeapproximabilitygadget reduction

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Differential approximation results for the Steiner tree problem ⋮ Steiner trees in uniformly quasi-bipartite graphs. ⋮ Unnamed Item

This page was built for publication: