The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice.
€214.99
यह ईबुक खरीदें और 1 और मुफ़्त पाएं!
भाषा अंग्रेज़ी ● स्वरूप PDF ● पेज 376 ● ISBN 9789812791450 ● फाइल का आकार 5.1 MB ● प्रकाशक World Scientific Publishing Company ● शहर Singapore ● देश SG ● प्रकाशित 2008 ● डाउनलोड करने योग्य 24 महीने ● मुद्रा EUR ● आईडी 2446502 ● कॉपी सुरक्षा Adobe DRM
एक DRM सक्षम ईबुक रीडर की आवश्यकता है
एक ही लेखक से अधिक ईबुक / संपादक
74,365 इस श्रेणी में ईबुक
