arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1210.3833cs.DS
收藏

改进的点布局问题的上下界

Improved upper and lower bounds for the point placement problem

Md. Shafiul Alam, Asish Mukhopadhyay

摘要:

点放置问题是确定一组$n$不同点的位置,P = {p1,p2,p3,.,pn},在直线上唯一地,直到平移和反射,从点对之间的最小可能距离查询。每个距离查询对应于图中的一个边,称为点放置图ppg,其顶点集为P。放置的唯一性要求转化为ppg的线刚度。本文给出了如何在两轮中构造一个长度为9 n/7 + O(1)的直线刚性点布局图。这改进了现有的4 n/3 + O(1)的最佳结果。我们还将两轮算法的下界从17 n/16提高到9 n/8。

英文摘要:

The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points. Each distance query corresponds to an edge in a graph, called point placement graph ppg, whose vertex set is P. The uniqueness requirement of the placement translates to line rigidity of the ppg. In this paper we show how to construct in 2 rounds a line rigid point placement graph of size 9n/7 + O(1). This improves the existing best result of 4n/3 + O(1). We also improve the lower bound on 2-round algorithms from 17n/16 to 9n/8.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑