检索结果-内蒙古大学图书馆

Randomized algorithms for the on-line minimum matching problem on Euclidean space

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1995年第1-2期58卷 19-32页

作者： Tsai, YT Tang, CY Chen, YY NATL TSING HUA UNIV DEPT COMP SCIHSINCHU 300TAIWAN

Suppose we are given two sets R and B, each of n points in the plane. Define the cost of a matching to be the teal distance of the edges in the, matching. The minimum matching problem on Euclidean space is to find a complete bipartite matching which has the minimum cost on Euclidean space. In this paper, we are interested in the on-line minimum matching problem on Euclidean space. We assume the set R is known, but the points of set B are revealed one by one. When a point of set B arrives, we must decide what match to make involving the point. None of the matches can be changed after they are made. the on-line minimum matching problem on Euclidean space tries to minimize the cost of the complete bipartite matching that we find. This paper proposes a family of randomized algorithms, Algorithm RM(m) (1 less than or equal to m less than or equal to n), for solving this problem. When a point in the set B arrived, Algorithm RM(m) randomly chooses at most m unmatched points in the set R, and adds the minimum edge between the arriving point and the chosen points to the matching. In each decision step, the algorithm only runs in O(m) time, which is superior to the known non-randomized algorithms for this problem. In this paper, we show that Algorithm RM(m) is not a competitive on-line algorithm for 1 less than or equal to m less than or equal to n-1. However, we further show that if 2n is large, the average cost incurred by Algorithm RM(m) (1 less than or equal to m less than or equal to n) is bounded by O(root n) times the average cost of the optimal Euclidean minimum matching.

关键词： analysis of algorithms on-line algorithms randomized algorithms the on-line minimum matching problem competitive analysis average case analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：