The best choice problem for upward directed graphs
type: Item
instance of: scholarly article
title: The best choice problem for upward directed graphs
zbMATH Open document ID: 1254.90282
author: Małgorzata Sulkowska
published in: Discrete Optimization
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 60G40
zbMATH DE Number: 6119007
zbMATH Keywords: directed graph
zbMATH Keywords: secretary problem
zbMATH Keywords: best choice
zbMATH Keywords: universal algorithm
MaRDI profile type: Publication
full work available at URL: j.disopt.2012.04.001
OpenAlex ID: W1995704185
cites work: Dynamic Programming and Decision Theory
cites work: Who solved the secretary problem
cites work: Q3921912
cites work: Q4012000
cites work: Partial-order analogue of the secretary problem: The binary tree case
cites work: How to choose the best twins
cites work: The best choice problem for posets; colored complete binary trees
cites work: An Upper Bound for Spherical Caps
cites work: The best-choice problem for partially ordered objects.
cites work: On a universal best choice algorithm for partially ordered sets
cites work: Q2959924
cites work: The secretary problem on an unknown poset
cites work: Partially ordered secretaries
cites work: Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
cites work: Gusein-Zade problem for directed path
cites work: Optimal stopping in a search for a vertex with full degree in a random graph
DOI: 10.1016/J.DISOPT.2012.04.001
Recommended article: Choice of best alternatives on directed graphs and tournaments
Recommended article: Optimal resolution sequence of problems modelled by directed graphs
Recommended article: Extremal problems for directed graphs
Recommended article: From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path
Recommended article: A contribution to a problem of directed graphs
Recommended article: Q4035548
Recommended article: On the acyclic choosability of graphs
Recommended article: An improved upper bound on edge weight choosability of graphs
Recommended article: A refinement of choosability of graphs
description: scientific article; zbMATH DE number 6119007