arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.10451cs.DS
收藏

单变量线性函数的复合排序与矩阵乘法排序

Composition Orderings for Linear Functions and Matrix Multiplication Orderings

Susumu Kubo, Kazuhisa Makino, Souta Sakamoto

AI总结:

本文研究了单变量线性函数的复合排序及矩阵乘法排序问题,通过将线性函数视为二维向量给出了最优排序的完整刻画,并提出了针对递减函数数量的FPT算法,同时证明了若干自然推广情形的NP-hard性。

摘要:

我们考虑单变量线性函数的复合排序问题。给定 $n$ 个线性函数 $f_1,\dots,f_n$ 和一个常数 $c$,目标是找到一个排列 $σ$,使得 $f_{σ(n)}\circ\dots\circ f_{σ(1)}(c)$ 最小化或最大化。该问题最初在时间依赖调度领域中被研究,并且已知如果所有函数都是非递减的,则可以在 $O(n\log n)$ 时间内求解。在本文中,通过将线性函数视为二维向量,我们对这种情况下的最优复合排序给出了完整刻画。我们还展示了最优复合排序的几个有趣性质,例如局部最优性与全局最优性之间的等价性。此外,利用上述刻画,针对一般线性函数的复合排序问题,我们提供了一个关于递减线性函数数量的固定参数可解(FPT)算法。接下来,我们将矩阵乘法排序作为线性函数复合的推广进行处理。给定 $n$ 个矩阵 $M_1,\dots,M_n\in\mathbb{R}^{m\times m}$ 和两个向量 $w,y\in\mathbb{R}^m$,其中 $m$ 表示一个正整数,目标是找到一个排列 $σ$,使得 $w^\top M_{σ(n)}\dots M_{σ(1)} y$ 最小化或最大化。该问题也被视为通过极限操作对流水车间调度问题的推广。通过这种扩展,我们证明了如果所有矩阵可同时三角化且具有非负行列式,则 $2\times 2$ 矩阵的乘法排序问题可在 $O(n\log n)$ 时间内求解;如果所有矩阵可同时三角化,则该问题关于具有负行列式的矩阵数量是 FPT 的。在负面结果方面,我们最终证明了三种可能的自然推广是 NP-hard 的:1) 当 $m=2$ 时;2) 当 $m\geq 3$ 时;3) 该问题的目标版本。

英文摘要:

We consider composition orderings for linear functions of one variable. Given $n$ linear functions $f_1,\dots,f_n$ and a constant $c$, the objective is to find a permutation $σ$ that minimizes/maximizes $f_{σ(n)}\circ\dots\circ f_{σ(1)}(c)$. It was first studied in the area of time-dependent scheduling, and known to be solvable in $O(n\log n)$ time if all functions are nondecreasing. In this paper, we present a complete characterization of optimal composition orderings for this case, by regarding linear functions as two-dimensional vectors. We also show several interesting properties on optimal composition orderings such as the equivalence between local and global optimality. Furthermore, by using the characterization above, we provide a fixed-parameter tractable (FPT) algorithm for the composition ordering problem for general linear functions, with respect to the number of decreasing linear functions. We next deal with matrix multiplication orderings as a generalization of composition of linear functions. Given $n$ matrices $M_1,\dots,M_n\in\mathbb{R}^{m\times m}$ and two vectors $w,y\in\mathbb{R}^m$, where $m$ denotes a positive integer, the objective is to find a permutation $σ$ that minimizes/maximizes $w^\top M_{σ(n)}\dots M_{σ(1)} y$. The problem is also viewed as a generalization of flow shop scheduling through a limit. By this extension, we show that the multiplication ordering problem for $2\times 2$ matrices is solvable in $O(n\log n)$ time if all the matrices are simultaneously triangularizable and have nonnegative determinants, and FPT with respect to the number of matrices with negative determinants, if all the matrices are simultaneously triangularizable. As the negative side, we finally prove that three possible natural generalizations are NP-hard: 1) when $m=2$, 2) when $m\geq 3$, and 3) the target version of the problem.

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

↑