On optimization problems in acyclic hypergraphs

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2023-08-01 DOI:10.1016/j.ipl.2023.106390

Naoyuki Kamiyama

引用次数: 1

Abstract

Binary polynomial optimization (BPO) is the problem of maximizing a polynomial function on the Boolean domain. This problem can be formulated by using a hypergraph, and various properties of the input hypergraph have been investigated from the viewpoint of polynomial-time solvability. In this paper, we especially focus on β-acyclic hypergraphs. For BPO over β-acyclic hypergraphs, Del Pia and Di Gregorio proposed a polynomial-time algorithm. We prove that the algorithm proposed by Del Pia and Di Gregorio can be extended to a more general optimization problem in β-acyclic hypergraphs.

查看原文本刊更多论文

关于非循环超图中的优化问题

二元多项式优化（BPO）是布尔域上多项式函数的最大化问题。这个问题可以用超图来表示，并且从多项式时间可解性的角度研究了输入超图的各种性质。在本文中，我们特别关注β-非循环超图。对于β-非循环超图上的BPO，Del Pia和Di Gregorio提出了一种多项式时间算法。我们证明了Del Pia和Di Gregorio提出的算法可以推广到β-非循环超图中更一般的优化问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.