Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
The Steiner Tree Problem and Its Generalizations

The Steiner Tree Problem and Its Generalizations

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 1444/1998
BookApproximation Algorithms for Combinatiorial Optimization
DOI10.1007/BFb0053958
Copyright1998
ISBN978-3-540-64736-2
Pages111-128
Subject CollectionComputer Science
SpringerLink DateThursday, February 19, 2004
Add to marked items
Abstract

We will survey recent approximation algorithms for the metric Steiner tree problem and its generalization, the Steiner network problem. We will also discuss the bidirected cut relaxation for the metric Steiner tree problem.

Fulltext Preview (Small, Large)
Image of the first page of the fulltext
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.107 • Server: mpweb05
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)