Searches on a Binary Tree with Random Edge-Weights

DOI10.1017/S0963548399004083MaRDI QIDQ4946836zbMATH OpenOpenAlexFDO

Authors Alan M. Stacey

Publication date 23 March 2000

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548399004083

zbMATH Keywords

standard rooted binary tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Greedy Search on the Binary Tree with Random Edge-Weights
• Improved approximation algorithms for the average-case tree searching problem
• Search cost for a nearly optimal path in a binary tree
• A Greedy Algorithm Estimating the Height of Random Trees
• scientific article; zbMATH DE number 1334602

Cited in

(6)

• An almost-greedy search on random binary vectors and random graphs
• An Improved Bound for Random Binary Search Trees with Concurrent Insertions
• Greedy Search on the Binary Tree with Random Edge-Weights
• Optimal reward on a sparse tree with random edge weights
• High Spies (or How to Win a Programming Contest)
• Search cost for a nearly optimal path in a binary tree

This page was built for publication: Searches on a Binary Tree with Random Edge-Weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946836)