Articoli correlati a The Probabilistic Minimum Spanning Tree Problem: Complexity...

The Probabilistic Minimum Spanning Tree Problem: Complexity and Combinatorial Properties (Classic Reprint) - Rilegato

 
9780265619247: The Probabilistic Minimum Spanning Tree Problem: Complexity and Combinatorial Properties (Classic Reprint)

Sinossi

Excerpt from The Probabilistic Minimum Spanning Tree Problem: Complexity and Combinatorial Properties

In this paper we consider a natural probabilistic variation of this classical problem. In particular, we consider the case where not all the points are deterministically present, but are present with certain probability. Formally, given a weighted graph G (v, E) and a probability of presence p(s) for each subset S of V, we want to construct an a priori spanning tree of minimum expected length in the following sense: on any given instance of the problem delete the vertices and their adjacent edges among the set of absent vertices provided that the tree remains connected. The problem of finding an a priori spanning tree of minimum expected length is the probabilistic minimum spanning tree (pmst) problem. In order to clarify the definition of the pmst problem, consider the example in Figure 1. If the a priori tree is T and nodes are the only ones not present, the tree becomes ti. One can easily observe that if every node is present with probability p. 1 for all i E V then the problem reduces to the classical mst problem.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

EUR 1,93 per la spedizione da U.S.A. a Italia

Destinazione, tempi e costi

Altre edizioni note dello stesso titolo

9781332276097: The Probabilistic Minimum Spanning Tree Problem: Complexity and Combinatorial Properties (Classic Reprint)

Edizione in evidenza

ISBN 10:  1332276091 ISBN 13:  9781332276097
Casa editrice: Forgotten Books, 2018
Brossura

Risultati della ricerca per The Probabilistic Minimum Spanning Tree Problem: Complexity...

Foto dell'editore

Dimitris Bertsimas
Editore: Forgotten Books, 2018
ISBN 10: 0265619246 ISBN 13: 9780265619247
Nuovo Rilegato

Da: PBShop.store US, Wood Dale, IL, U.S.A.

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LX-9780265619247

Contatta il venditore

Compra nuovo

EUR 24,50
Convertire valuta
Spese di spedizione: EUR 1,93
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: 15 disponibili

Aggiungi al carrello

Foto dell'editore

Dimitris Bertsimas
Editore: Forgotten Books, 2018
ISBN 10: 0265619246 ISBN 13: 9780265619247
Nuovo Rilegato

Da: PBShop.store UK, Fairford, GLOS, Regno Unito

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LX-9780265619247

Contatta il venditore

Compra nuovo

EUR 22,44
Convertire valuta
Spese di spedizione: EUR 5,78
Da: Regno Unito a: Italia
Destinazione, tempi e costi

Quantità: 15 disponibili

Aggiungi al carrello