The Steiner Tree Problem

Edited by
  • Frank K. Hwang - AT&T Bell Laborarories, Murray Hill, NJ, U.S.A.
  • Dana S. Richards - University of Virginia, Thornton Hall, VA, U.S.A.
  • Pawel Winter - University of Copenhagen, Copenhagen, Denmark
Volume 53,

Pages ii-vi, 3-339 (1992)

Actions for selected chapters

/

Contents

    1. General Editor

      Page ii
      View PDF
    1. Edited by

      Page iii
      View PDF
    1. Copyright page

      Page iv
    1. Foreword

      Pages v-vi
  1. I Euclidean Steiner Problem

    1. Chapter 1 Introduction

      Pages 3-19
    2. Chapter 2 Exact Algorithms

      Pages 21-35
    3. Chapter 3 The Steiner Ratio

      Pages 37-49
    4. Chapter 4 Heuristics

      Pages 51-61
    5. Chapter 5 Special Terminal-Sets

      Pages 63-76
    6. Chapter 6 Generalizations

      Pages 77-89
  2. II Steiner Problem in Networks

    1. Chapter 1 Introduction

      Pages 93-102
    2. Chapter 2 Reductions

      Pages 103-124
    3. Chapter 3 Exact Algorithms

      Pages 125-149
    4. Chapter 4 Heuristics

      Pages 151-176
    5. Chapter 5 Polynomially Solvable Cases

      Pages 177-188
    6. Chapter 6 Generalizations

      Pages 189-202
  3. III Rectilinear Steiner Problem

    1. Chapter 1 Introduction

      Pages 205-219
    2. Chapter 2 Heuristic Algorithms

      Pages 221-242
    3. Chapter 3 Polynomially Solvable Cases

      Pages 243-255
    4. Chapter 4 Generalizations

      Pages 257-266
    5. Chapter 5 Routing

      Pages 267-283
  4. IV Other Steiner Problems

    1. Chapter 1 Steiner Trees in Other Metric Spaces

      Pages 287-300
    2. Chapter 2 Phylogenetic Trees

      Pages 301-321
    1. Subject Index

      Pages 323-334
      View PDF
    1. Author Index

      Pages 335-339
      View PDF

ISBN: 978-0-444-89098-6

ISSN: 0167-5060