BROWSE

Author Profile

TOPIC

    NUMBER OF VISITS

    Browsing by Author Bernhard Korte

    Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
    or enter first few letters:  
    Showing results 1 to 2 of 2
    • TVS.005422_Bernhard Korte, Jens Vygen (auth.) - Combinatorial Optimization_ Theory and Algorithms-Springer-Verlag Berlin Heidelberg (2012) (1)-1.pdf.jpg
    • Sách/Book

    • Combinatorial optimization : theory and algorithms

      • Authors: Bernhard Korte (2012)

    • This fifth edition has again been updated, revised, and significantlyextended, with more than 60 new exercises and new material on varioustopics, including Cayley's formula, blocking flows, faster"b"-matching separation, multidimensional knapsack, multicommoditymax-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
    • TVS.005421. (Algorithms and Combinatorics 21) Korte, Bernhard_ Vygen, Jens - Combinatorial optimization. Theory and algorithms-Springer (2018)-TT.pdf.jpg
    • Sách/Book

    • Combinatorial optimization : theory and algorithms

      • Authors: Bernhard Korte (2018)

    • This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization.