当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the Solution Bound of Two-Sided Scaffold Filling
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2021-04-28 , DOI: 10.1016/j.tcs.2021.04.024
Jingjing Ma , Daming Zhu , Haitao Jiang , Binhai Zhu

In this paper, we propose an algorithm which approximates the Two-Sided Scaffold Filling problem to a better performance ratio of 1.4+ε. This is achieved through a deep investigation of the optimal solution structure of Two-Sided Scaffold Filling. We make use of a relevant graph aiming at a solution of a Two-Sided Scaffold Filling instance, and evaluate the optimal solution value by the number of connected components in this graph. We show that an arbitrary optimal solution can be transformed into one whose relevant graph admits connected components that are available to compare with the solution of our algorithm in terms of their values. The performance ratio 1.4+ε is obtained by comparing the bound of such an optimal solution with the solution of our algorithm.



中文翻译:

关于双面脚手架填充的解界

在本文中,我们提出了一种将双面脚手架填充问题近似为1.4+ ε更好的性能比的算法。这是通过对双面脚手架填充的最佳解决方案结构进行深入研究而实现的。我们利用针对两边脚手架填充实例的解决方案的相关图,并通过该图中的连接组件数来评估最佳解决方案值。我们表明,可以将任意最优解转换为一个其相关图允许连接的组件,这些组件可以根据其值与我们的算法的解决方案进行比较。效能比1.4+ ε 通过将这种最优解的边界与我们算法的解进行比较来获得。

更新日期:2021-04-29
down
wechat
bug