arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.07370math.CO
收藏

关于最小-最大星划分数量

On the Min-Max Star Partitioning Number

Sarah Feldmann, Torben Schürenberg

AI总结:

针对简单连通图的新型星划分问题,提出多项式时间最优算法并推广至多种图类,利用流技术优化运行时间,证明节点加权判定版为强NP完全问题,还与相关问题做了对比。

摘要:

本文针对简单连通图$G=(V,E)$提出了一类新型星划分问题。该问题的目标是将图的边划分为若干星结构,在满足各节点专属容量约束的同时,最小化单个节点所属星的最大数量。我们设计并分析了一种时间复杂度为$\boldsymbol{\frac{1}{2}}$的高效多项式时间算法,可求解最优划分。此外,我们还针对部分图类给出了最优值的显式闭式表达式。我们将算法进一步推广,可求解线性超图、多重图以及带自环图的最优星划分问题。我们利用流技术设计了一种改进的星划分问题算法,时间复杂度为$\boldsymbol{\frac{2}{3}}$,其中$Δ$为图$G$的最大节点度。与无权情形不同,我们证明该问题的节点加权判定版本即使在无容量约束的条件下,仍是强NP完全(strongly NP-complete)问题。此外,我们还将该问题与满足节点容量约束的最小入度最小化问题进行了全面对比。

英文摘要:

In this paper, we introduce a novel star partitioning problem for simple connected graphs $G=(V,E)$. The goal is to find a partition of the edges into stars that minimizes the maximum number of stars a node is contained in while simultaneously satisfying node-specific capacities. We design and analyze an efficient polynomial time algorithm with a runtime of $\mathcal{O}(|E|^2)$ that determines an optimal partition. Moreover, we explicitly provide a closed form of an optimal value for some graph classes. We generalize our algorithm to find even an optimal star partition of linear hypergraphs, multigraphs, and graphs with self-loop. We use flow techniques to design an algorithm for the star partitioning problem with an improved runtime of $\mathcal{O}(\log(Δ) \cdot |E| \cdot \min\{|V|^{\frac{2}{3}},|E|^{\frac{1}{2}}\})$, where $Δ$ is maximum node degree in $G$. In contrast to the unweighted setting, we show that a node-weighted decision variant of this problem is \texttt{strongly NP-complete} even without capacity constraints. Furthermore, we provide an extensive comparison to the problem of minimizing the minimum indegree satisfying node capacity constraints.

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

↑