秘书问题:图,拟阵和拟阵
Secretary problem: graphs, matroids and greedoids
摘要:
在该文件中,被认为是众所周知的“秘书问题”的推广。本文的目的是给出一个通用的模型,在这样一种方式,选择的一组可能的最佳$k$元素必须是独立的所有被拒绝的元素。这个条件是制定使用理论的greedoids和在其特殊情况下-拟阵和antimatroids。一些特殊情况下的拟阵(均匀,图形拟阵和二叉树)的例子被认为是。
英文摘要:
In the paper the generalisation of the well known "secretary problem" is considered. The aim of the paper is to give a generalised model in such a way that the chosen set of the possible best $k$ elements have to be independent of all rejected elements. This condition is formulated using the theory of greedoids and in their special cases -- matroids and antimatroids. Examples of some special cases of greedoids (uniform, graphical matroids and binary trees) are considered.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。