... (3) 238 Wang, C.A., (2) 622, 633 Wang, C., (2) 386 Wang, C.C., (1) 642, 667; (2) 392 Wang, D.I., (2) 362, 392 Wang, H., (2) 725 Wang, J., (1) 221, 225, 291; (2) 76 Wang, J.F., (2) 395 Wang, K., (2) 725 Wang, L., (2) 74, 76 Wang, ...
This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.
Handbook of Combinatorial Optimization
The second edition of this 5-volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come.
Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization.
HANDBOOK OF COMBINATORIAL OPTIMIZATION D.-Z. Du and P.M. Pardalos ( Eds . ) pp . 75-149 © 1999 Kluwer Academic Publishers Linear Assignment Problems and Extensions * Rainer E. Burkard and Eranda Çela Institute of Mathematics Technical ...
HANDBOOK OF COMBINATORIAL OPTIMIZATION ( VOL . 2 ) D.-Z. Du and P.M. Pardalos ( Eds . ) pp . 159-260 © 1998 Kluwer Academic Publishers Resource Allocation Problems Naoki Katoh Department of Architecture and Architectural Systems ...
This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.
Here e is called the error probability . Note that this probability is independent of the input distribution . ... 2.4 Chernoff Bounds One of the frequently used results from probability theory in the analysis of randomized algorithms ...