The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties

The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties

Includes bibliographical references.

Bibliographic Details
Other Authors:	Bertsimas, Dimitris J.
Language:	eng
Published:	Massachusetts Institute of Technology, Operations Research Center 2004
Online Access:	http://hdl.handle.net/1721.1/5077

Similar Items

The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties
by: Bertsimas, Dimitris
Published: (2009)

The Probabilistic Minimum Spanning Tree, Part II: Probabilistic Analysis and Asymptotic Results
by: Bertsimas, Dimitris J.
Published: (2004)

Cube versus Torus Models for Combinatorial Optimization Problems and the Euclidean Minimum Spanning Tree Constant
by: Jaillet, Patrick
Published: (2004)

The Stackelberg Minimum Spanning Tree Game
by: Cardinal, Jean, et al.
Published: (2019)

New neighborhood search structures for the capacitated minimum spanning tree problem
Published: (2003)

Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
by: Paul, Alice, et al.
Published: (2021)

Minimum spanning tree pada graf monge
by: , INDRIATI, Diari, et al.
Published: (2000)

Probabilistic combinatorial optimization problems
by: Bertsimas, Dimitris
Published: (2005)

An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
Published: (2003)

A distributed algoritm for minimum weight directed spanning trees
Published: (2003)

Correlation network analysis of safety culture using minimum spanning tree
by: Sharif, Shamshuritawati, et al.
Published: (2011)

Correlation network analysis of safety culture using minimum spanning tree
by: Sharif, Shamshuritawati, et al.
Published: (2012)

The stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
by: Cardinal, Jean, et al.
Published: (2011)

Brief announcement: Minimum spanning trees and cone-based topology control
by: Cornejo Collado, Alex, et al.
Published: (2010)

Solution strategies for the spanning tree detection problem
by: Ye, Min Thu.
Published: (2012)

Inverse spanning tree problems : formulations and algorithms
by: Sokkalingam, P. T., et al.
Published: (2009)

Network Flow Models for Designing Diameter-Constrained Minimum Spanning and Steiner Trees
by: Gouveia, Luis, et al.
Published: (2004)

Worker’s behaviour in manufacturing industry: An evidence from a minimum spanning tree
by: Sharif, Shamshuritawati, et al.
Published: (2012)

Outlier detection in circular regression model using minimum spanning tree method
by: Nur Faraidah, Muhammad Di, et al.
Published: (2019)

Outlier detection in circular regression model using minimum spanning tree method
by: Nur Faraidah, Muhammad Di, et al.
Published: (2019)

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
by: Wang, Yiqiu, et al.
Published: (2022)

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
by: Wang, Yiqiu, et al.
Published: (2022)

A Lattice-structured Proof Technique Applied to a Minimum Spanning Tree Algorithm
by: Welch, Jennifer Lundelius, et al.
Published: (2023)

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering (Abstract)
by: Wang, Yiqiu, et al.
Published: (2023)

Interval elimination method for stochastic spanning tree problem
by: Mohd, Ismail
Published: (1994)

The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model; A Unified Approach
by: Avram, Florin, et al.
Published: (2004)

Network analysis on safety culture and worker‘s behaviour : A forest of all minimum spanning trees
by: Djauhari, Maman A., et al.
Published: (2012)

CMSTR: a constrained minimum spanning tree based routing protocol for wireless sensor networks
by: Lin, Deyu, et al.
Published: (2023)

An Alternative to Optimize the Indonesian's Airport Network Design: AnApplication of Minimum Spanning Tree (MST)Technique
by: Perpustakaan UGM, i-lib
Published: (2012)

Combinatorial properties of shifted complexes
by: Klivans, Caroline J. (Caroline Jane), 1977-
Published: (2005)

Probabilistic methods in combinatorial and stochastic optimization
by: Vondrák, Jan, 1974-
Published: (2005)

Graph dan minimum spanning tree sebagai model pengambilan keputusan pada sistem pendukung pengambiln keputusan
by: , BASTARI, UT Hidayat, et al.
Published: (2003)

An alterable weight minimum spanning tree method for electrical collector system planning in tidal current generation farms
by: Ren, Zhouyang, et al.
Published: (2019)

Faster generation of random spanning trees
by: Ma̧dry, Aleksander
Published: (2010)

Faster generation of random spanning trees
by: Kelner, Jonathan Adam, et al.
Published: (2010)

An exact combinatorial algorithm for minimum graph bisection
by: Delling, Daniel, et al.
Published: (2016)

Algorithms and algorithmic obstacles for probabilistic combinatorial structures
by: Li, Quan, Ph. D. Massachusetts Institute of Technology
Published: (2018)

Multidimensional minimal spanning tree: the bursa Malaysia
by: Lim San Yee, San Yee, et al.
Published: (2018)

A quantum algorithm for minimal spanning tree
by: Aghaei, Mohammad Reza Soltan, et al.
Published: (2008)

Time optimal self-stabilizing spanning tree algorithms
by: Aggarwal, Sudhanshu Madan
Published: (2007)