Greedy Search on the Binary Tree with Random Edge-Weights
type: Item
instance of: scholarly article
title: Greedy Search on the Binary Tree with Random Edge-Weights
zbMATH Open document ID: 0803.68025
DOI: 10.1017/S096354830000033X
author: David Aldous
published in: Combinatorics, Probability and Computing
publication date: 1994-05-05T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 60G50
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 563571
zbMATH Keywords: searching
zbMATH Keywords: greedy algorithm
zbMATH Keywords: binary tree
MaRDI profile type: Publication
cites work: A fixed point theorem for distributions
cites work: Fixed points of the smoothing transformation
cites work: A path decomposition for Markov processes
cites work: A branching random walk with a barrier
cites work: Chernoff's theorem in the branching random walk
cites work: Random walks on a tree and capacity in the interval
cites work: Discounted branching random walks
cites work: Q4004056
cites work: Random walk in a random environment and first-passage percolation on trees
cites work: The \(3x +1\) problem: Two stochastic models
cites work: Q5585020
cites work: Searching for an optimal path in a tree with random costs
cites work: Q5512461
cites work: Probability metrics and recursive algorithms
description: scientific article; zbMATH DE number 563571