Skip to main content
Book

The Steiner tree problem : a tour through graphs, algorithms, and complexity

  • Prömel H
  • Steger A
  • Winter P
N/ACitations
Citations of this article
21Readers
Mendeley users who have this article in their library.

Abstract

1st ed. 1. Basics I: Graphs -- 2. Basics II: Algorithms -- 3. Basics III: Complexity -- 4. Special Terminal Sets -- 5. Exact Algorithms -- 6. Approximations Algorithms -- 7. More on Approximation Algorithms -- 8. Randomness Helps -- 9. Limits of Approximability -- 10. Geometric Steiner Problems.

Cite

CITATION STYLE

APA

Prömel, H. J., Steger, Angelika., & Winter, P. (2002). The Steiner tree problem : a tour through graphs, algorithms, and complexity (p. 241). North-Holland: Vieweg.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free