cartcart

    Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

     
    Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

    Description

    This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.

    Product details

    EAN/ISBN:
    9783642635816
    Edition:
    Softcover reprint of the original 1st ed. 1999
    Format:
    Illustriert
    Medium:
    Paperback
    Number of pages:
    548
    Publication date:
    2013-10-03
    Publisher:
    Springer
    EAN/ISBN:
    9783642635816
    Edition:
    Softcover reprint of the original 1st ed. 1999
    Format:
    Illustriert
    Medium:
    Paperback
    Number of pages:
    548
    Publication date:
    2013-10-03
    Publisher:
    Springer

    Shipping

    laposte
    The edition supplied may vary.
    Currently sold out