scientific article; zbMATH DE number 2044939

From MaRDI portal

Revision as of 04:26, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4448761

Jump to:navigation, search

zbMath1042.68635MaRDI QIDQ4448761

Stefan Hougardy, Clemens Gröpl, Hans Jürgen Prömel, Till Nierhoff

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040217.htm

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

Strong Steiner Tree Approximations in Practice ⋮ Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees ⋮ A partition-based relaxation for Steiner trees ⋮ Approaches to the Steiner Problem in Networks ⋮ Steiner trees in uniformly quasi-bipartite graphs.

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4448761&oldid=18500411"