Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Supporting your high street Find out how »
The Probabilistic Minimum Spanning Tree Problem : Complexity and Combinatorial Properties, PDF eBook

The Probabilistic Minimum Spanning Tree Problem : Complexity and Combinatorial Properties PDF

PDF

Download - Immediately Available
Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

Whilst the greatest effort has been made to ensure the quality of this text, due to the historical nature of this content, in some rare cases there may be minor issues with legibility.

In this paper we consider a natural probabilistic variation of the classical minimum spanning tree (MST) problem, which we call the probabilistic minimum spanning tree problem (PMST).

In particular, we consider the case where not all the points are deterministically present, but are present with certain probability.

We discuss the applications of the PMST and find a closed form expression for the expected length of a given spanning tree.

Based on these expressions we prove that the problem is N P - complete.

We further examine some combinatorial properties of the problem, establish the relation of the PMST problem with the MST problem and the network design problem and examine some cases where the problem is solvable in polynomial time.

Information

Other Formats

Save 15%

£5.85

£4.97

Download - Immediately Available
Add to Basket
Sign in to add to wishlist
 
Delivered to your inbox

to transfer to your device

eBook Help

Is this the right eBook for
my device? How do I download
this eBook? See help and FAQs pages

Information