scientific article

zbMATH Open0768.68189MaRDI QIDQ4028261FDOQ4028261

Bernard M. Waxman

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

approximation algorithmsapproximation schemesSteiner tree problemworst-case performanceRayward-Smith's algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (1)

• How Many Steiner Terminals Can You Connect in 20 Years?

Recommendations

• A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 👍 👎
• A faster approximation algorithm for the Steiner problem in graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028261)