arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.05480cs.DScs.DM
收藏

分段线性函数的最优复合序问题

Optimal Composition Ordering Problems for Piecewise Linear Functions

Yasushi Kawase, Kazuhisa Makino, Kento Seimi

摘要:

在本文中,我们介绍了最大合成序问题。输入是$n$实函数$f_1,\dots,f_n:\mathbb{R}\to\mathbb{R}$和常数$c\in\mathbb{R}$。我们考虑两种设置:总和部分组成。最大全合成排序问题是计算使$f_{σ(n)}\circ f_{σ(n-1)}\circ\dots\circ f_{σ(1)}(c)$最大化的置换$σ:[n]\to[n]$,其中$[n]=\{1,\dots,n\}$。最大部分合成排序问题是计算一个置换$σ:[n]\to[n]$和一个非负整数$k~(0\le k\le n)$,使$f_{σ(k)}\circ f_{σ(k-1)}\circ\dots\circ f_{σ(1)}(c)$最大化。针对单调线性函数$f_i$的最大全和部分合成排序问题,提出了$O(n\log n)$时间算法,推广了时间依赖排序问题的线性退化和缩短模型.我们还证明了最大部分复合排序问题可以在多项式时间内解决,如果$f_i$是$\max\{a_ix+b_i,c_i\}$的形式,一些常数$a_i\,(\ge 0)$,$b_i$和$c_i$。最后,我们证明了不存在常数因子逼近算法的问题,即使$f_i$的单调,分段线性函数,最多有两个片段,除非P=NP。

英文摘要:

In this paper, we introduce maximum composition ordering problems. The input is $n$ real functions $f_1,\dots,f_n:\mathbb{R}\to\mathbb{R}$ and a constant $c\in\mathbb{R}$. We consider two settings: total and partial compositions. The maximum total composition ordering problem is to compute a permutation $σ:[n]\to[n]$ which maximizes $f_{σ(n)}\circ f_{σ(n-1)}\circ\dots\circ f_{σ(1)}(c)$, where $[n]=\{1,\dots,n\}$. The maximum partial composition ordering problem is to compute a permutation $σ:[n]\to[n]$ and a nonnegative integer $k~(0\le k\le n)$ which maximize $f_{σ(k)}\circ f_{σ(k-1)}\circ\dots\circ f_{σ(1)}(c)$. We propose $O(n\log n)$ time algorithms for the maximum total and partial composition ordering problems for monotone linear functions $f_i$, which generalize linear deterioration and shortening models for the time-dependent scheduling problem. We also show that the maximum partial composition ordering problem can be solved in polynomial time if $f_i$ is of form $\max\{a_ix+b_i,c_i\}$ for some constants $a_i\,(\ge 0)$, $b_i$ and $c_i$. We finally prove that there exists no constant-factor approximation algorithm for the problems, even if $f_i$'s are monotone, piecewise linear functions with at most two pieces, unless P=NP.

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

↑