arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1609.01078cs.CC
收藏

有向图约束的子集和问题

Subset Sum Problems With Digraph Constraints

Laurent Gourvès, Jérôme Monnot, Lydia Tlilane

摘要:

我们介绍和研究四个优化问题,推广了著名的子集和问题。给定一个节点加权有向图,选择一个总权重不超过给定预算的顶点子集。需要满足一些额外的约束。弱(weak)有向图约束规定,如果(所有传入节点的resp.)节点$x$属于该解,则后者包括其所有输出节点(分别是节点$x$本身)。最大性约束确保解不能在不违反预算或(弱)有向图约束的情况下被扩展。我们研究了这些问题的复杂性,我们提出了一些近似结果,根据输入中给出的有向图的类型,例如有向无环图和定向树。关键词。子集和,极大值问题,有向图约束,复杂度,有向无环图,有向树,PTAS。

英文摘要:

We introduce and study four optimization problems that generalize the well-known subset sum problem. Given a node-weighted digraph, select a subset of vertices whose total weight does not exceed a given budget. Some additional constraints need to be satisfied. The (weak resp.) digraph constraint imposes that if (all incoming nodes of resp.) a node $x$ belongs to the solution, then the latter comprises all its outgoing nodes (node $x$ itself resp.). The maximality constraint ensures that a solution cannot be extended without violating the budget or the (weak) digraph constraint. We study the complexity of these problems and we present some approximation results according to the type of digraph given in input, e.g. directed acyclic graphs and oriented trees. Key words. Subset Sum, Maximal problems, digraph constraints, complexity, directed acyclic graphs, oriented trees, PTAS.

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

↑