Preface - Data Correcting Algorithms in Combinatorial Optimization - The Steiner Ratio of Banach-Minkowski Space - Probabilistic Verification and Non-Approximability - Steiner Trees in Industry - Network-Based Model and Algorithms in Data Mining and Knowledge Discovery - The Generalized Assignment Problem and Extensions - Optimal Rectangular Partitions - Connected Dominating Sets in Sensor Networks and MANETs - Author Index - Subject Index
This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set, as well as the Supplement Volume A. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject, including optimization problems and algorithmic approaches for discrete problems.
Audience
This handbook is suitable for all those who use combinatorial optimization methods to model and solve problems.