利用随机序比较不同的欧式随机指派问题
Using stochastic order to compare different Euclidean Random Assignment Problems
摘要:
本文利用两个欧氏随机指派问题中任一对的费用的随机序,给出了一个比较两个具有相同点数的欧氏随机指派问题的最小总费用的定理。随后的部分提供了定理的两个应用,包括一维$k$ -星图问题的研究和高维问题的比较。本文还讨论了该定理的进一步应用和局限性。
英文摘要:
This paper provides a theorem to compare the minimum total cost of two different Euclidean Random Assignment Problems with the same number of points, using the stochastic order of the costs of one of the pairs in these two problems. The subsequent sections provide two applications of the theorem, including studies of the problem on the one-dimensional $k$-star graph and comparisons between some problems in higher dimensions. More possible applications and limitations of the theorem are also discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。