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

Inhaltsangabe

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.

This work is in the "public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.

Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.