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

Longest Increasing Subsequence under persistent comparison errors

THEORY OF COMPUTING SYSTEMS 2020年第4期64卷 662-680页

作者： Geissmann, Barbara Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

We study the problem of computing a longest increasing subsequence in a sequence S of n distinct elements in the presence of persistent comparison errors. In this model, Braverman and Mossel (Noisy sorting without resampling, SODA 2008, pages 268-276, 2008) every comparison between two elements can return the wrong result with some fixed (small) probability p, and comparisons cannot be repeated. Computing the longest increasing subsequence exactly is impossible in this model, therefore, the objective is to identify a subsequence that (i) is indeed increasing and (ii) has a length that approximates the length of the longest increasing subsequence. We present asymptotically tight upper and lower bounds on both the approximation factor and the running time. In particular, we present an algorithm that computes an O(log n)-approximation in O(n log n) time, with high probability. This approximation relies on the fact that we can approximately sort (Geissmann et al. Optimal Sorting with persistent comparison errors, ArXiv e-prints 1804.07575, 2018) n elements in O(n log n) time such that the maximum dislocation of an element is O(logn). For the lower bounds, we prove that (i) there is a set of sequences, such that on a sequence picked randomly from this set every algorithm must return an Omega(log n)}-approximation with high probability, and (ii) any logn-approximation algorithm for longest increasing subsequence requires Omega(n log n) comparisons, even in the absence of errors.

关键词： Longest increasing subsequence probabilistic persistent comparison errors Approximation algorithm Lower bounds

来源：评论

学校读者我要写书评

暂无评论

Longest Increasing Subsequence Under persistent comparison errors 16th

Longest Increasing Subsequence Under Persistent Comparison E...

引用

16th International Workshop on Approximation and Online Algorithms (WAOA)

作者： Geissmann, Barbara Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland

ISBN: (纸本)9783030046934;9783030046927

We study the problem of computing a longest increasing subsequence in a sequence S of n distinct elements in the presence of persistent comparison errors. In this model, (Braverman and Mossel, Noisy sorting without resampling, SODA, 2008) every comparison between two elements can return the wrong result with some fixed (small) probability p, and comparisons cannot be repeated. Computing the longest increasing subsequence exactly is impossible in this model, therefore, the objective is to identify a subsequence that (i) is indeed increasing and (ii) has a length that approximates the length of the longest increasing subsequence. We present asymptotically tight upper and lower bounds on both the approximation factor and the running time. In particular, we present an algorithm that computes an O(log n)-approximation in time O(n log n), with high probability. This approximation relies on the fact that we can approximately sort (Geissmann, Leucci, Liu, and Penna, Optimal Sorting with persistent comparison errors, ArXiv e-prints 804.07575, 2018) n elements in O (n log n) time such that the maximum dislocation of an element is at most O(log n). For the lower bounds, we prove that (i) there is a set of sequences, such that on a sequence picked randomly from this set every algorithm must return an Omega(log n)-approximation with high probability, and (ii) any O(log n)-approximation algorithm for longest increasing subsequence requires at least Omega(n log n) comparisons, even in the absence of errors.

关键词： Longest increasing subsequence probabilistic persistent comparison errors Approximation algorithm Lower bounds

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：