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

关于Ulams度量在高维及对偶相关层次中的可处理性

On Tractability of Ulams Metric in Highier Dimensions and Dually Related Hierarchies

Sebastian Bala, Andrzej Kozik

摘要:

乌拉姆度量是从一个排列中移除一个元素并随后将其重新插入到不同位置的最小移动次数,以在两个给定的排列之间移动。未移动的元素创建最长公共子序列的排列。Aldous和Diaconis在他们的论文中指出,乌拉姆的度量是在关于排序和扔牌的问题中引入的。在本文中,我们定义并研究了在高维的乌拉姆度量:1维的考虑对象是一对排列,k维的它是一对k-元组的排列。在编码的k元组的排列,我们定义了两个双重相关的层次结构。我们的第一个动机来自Murata等人的论文,其中排列对被用来表示填充到最小面积的矩形之间的拓扑关系,并应用于VLSI物理设计。我们的研究结果涉及硬度,可逼近性和参数化的复杂性内的层次结构。

英文摘要:

The Ulam's metric is the minimal number of moves consisting in removal of one element from a permutation and its subsequent reinsertion in different place, to go between two given permutations. Thet elements that are not moved create longest common subsequence of permutations. Aldous and Diaconis, in their paper, pointed that Ulam's metric had been introduced in the context of questions concerning sorting and tossing cards. In this paper we define and study Ulam's metric in highier dimensions: for dimension one the considered object is a pair of permutations, for dimension k it is a pair of k-tuples of permutations. Over encodings by k-tuples of permutations we define two dually related hierarchies. Our very first motivation come from Murata at al. paper, in which pairs of permutations were used as representation of topological relation between rectangles packed into minimal area with application to VLSI physical design. Our results concern hardness, approximability, and parametrized complexity inside the hierarchies.

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

↑