The Steiner Tree Problem - A Tour through Graphs, Algorithms, and Complexity (Paperback, Softcover reprint of the original 1st ed. 2002)
Hans Jurgen Proemel, Angelika StegerIn recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity.
R1,448
Or split into 4x interest-free payments of 25% on orders over R50
Learn more
14480
@R136pm x 12* 
Ships in 10 - 15 working days
Add to wish listReview this Item
Donate to Against Period Poverty
Product Description
In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity.
Customer Reviews
No reviews or ratings yet - be the first to create one!
Product Details
General
Imprint | Vieweg+teubner Verlag |
Country of origin | Germany |
Series | Advanced Lectures in Mathematics |
Release date | February 2002 |
Availability | Expected to ship within 10 - 15 working days |
First published | February 2002 |
Authors | Hans Jurgen Proemel, Angelika Steger |
Dimensions | 240 x 170 x 13mm (L x W x T) |
Format | Paperback |
Pages | 241 |
Edition | Softcover reprint of the original 1st ed. 2002 |
ISBN-13 | 978-3-528-06762-5 |
Barcode | 9783528067625 |
Languages | value |
Subtitles | value |
Categories | |
LSN | 3-528-06762-4 |
Similar Products | Recommended ProductsSee more 
Trending On Loot
Be the first to know about our
latest deals & promos! Subscribe Now
