Partial-order analogue of the secretary problem: The binary tree case
From MaRDI portal
Recommendations
- A Ratio Inequality for Binary Trees and the Best Secretary
- Optimal binary trees with order constraints
- The Secretary Problem and Its Extensions: A Review
- On the complexity of searching in trees and partially ordered structures
- Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
- Strong algorithms for the ordinal matroid secretary problem
- Strong algorithms for the ordinal matroid secretary problem
- Improved algorithms and analysis for secretary problems and generalizations
Cites work
- scientific article; zbMATH DE number 3660567 (Why is no real title available?)
- scientific article; zbMATH DE number 3369559 (Why is no real title available?)
- A secretary problem with uncertain employment
- Optimal selection based on relative rank (the 'Secretary Problem')
- Recognizing the maximum of a random sequence based on relative rank with backward solicitation
- Who solved the secretary problem
Cited in
(21)- Gusein-Zade problem for directed path
- The best choice problem for upward directed graphs
- The best-choice problem for partially ordered objects.
- A Secretary Problem with Many Lives
- The secretary problem on an unknown poset
- Optimal stopping in a search for a vertex with full degree in a random graph
- Counting embeddings of a chain into a tree
- Counting embeddings of rooted trees into families of rooted trees
- A Ratio Inequality for Binary Trees and the Best Secretary
- The best choice problem for a union of two linear orders with common maximum
- Percolation and best-choice problem for powers of paths
- From directed path to linear order -- the best choice problem for powers of directed path
- Secretary problem with hidden information; searching for a high merit candidate
- An optimal algorithm for stopping on the element closest to the center of an interval
- Maximizing the expected number of components in an online search of a graph
- Optimal stopping for many connected components in a graph
- The best choice problem for posets; colored complete binary trees
- Secretary problem: graphs, matroids and greedoids
- An efficient algorithm for stopping on a sink in a directed graph
- Embeddings and other mappings of rooted trees into complete trees
- Monotone Case for an Extended Process
This page was built for publication: Partial-order analogue of the secretary problem: The binary tree case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584204)
