• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
The Probabilistic Minimum Spanning Tree Problem: Part I--complexity and Combinatorial Properties

The Probabilistic Minimum Spanning Tree Problem: Part I--complexity and Combinatorial Properties

Paperback

Business GeneralCalculusGeneral World History

ISBN10: 1021498386
ISBN13: 9781021498380
Publisher: Legare Street Pr
Published: Jul 18 2023
Pages: 48
Weight: 0.18
Height: 0.10 Width: 6.14 Depth: 9.21
Language: English

Dimitris Bertsimas, an expert in the field of operations research, provides an in-depth exploration of the probabilistic minimum spanning tree problem. With detailed analysis of various algorithms and combinatorial properties, this publication will appeal to researchers and practitioners alike.

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it.

1 different editions

Also available

Also from

Bertsimas, Dimitris

Also in

General World History