{"title":"(s, t)平面超图中的最小 $$ s-t$ 超切线","authors":"Abolfazl Hassanpour, Massoud Aman, Alireza Ebrahimi","doi":"10.1007/s10878-024-01231-w","DOIUrl":null,"url":null,"abstract":"<p>Planar hypergraphs are widely used in several applications, including VLSI design, metro maps, information visualisation, and databases. The minimum <span>\\( s-t \\)</span> hypercut problem in a weighted hypergraph is to find a partition of the vertices into two nonempty sets, <i>S</i> and <span>\\( \\overline{S} \\)</span>, with <span>\\(s\\in S\\)</span> and <span>\\(t\\in \\overline{S}\\)</span> that minimizes the total weight of hyperedges that have at least two endpoints in two different sets. In the present study, we propose an approach that effectively solves the minimum <span>\\( s-t \\)</span> hypercut problem in (<i>s</i>, <i>t</i>)-planar hypergraphs. The method proposed demonstrates polynomial time complexity, providing a significant advancement in solving this problem. The modelling example shows that the proposed strategy is effective at obtaining balanced bipartitions in VLSI circuits.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"9 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimum $$ s-t $$ hypercut in (s, t)-planar hypergraphs\",\"authors\":\"Abolfazl Hassanpour, Massoud Aman, Alireza Ebrahimi\",\"doi\":\"10.1007/s10878-024-01231-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Planar hypergraphs are widely used in several applications, including VLSI design, metro maps, information visualisation, and databases. The minimum <span>\\\\( s-t \\\\)</span> hypercut problem in a weighted hypergraph is to find a partition of the vertices into two nonempty sets, <i>S</i> and <span>\\\\( \\\\overline{S} \\\\)</span>, with <span>\\\\(s\\\\in S\\\\)</span> and <span>\\\\(t\\\\in \\\\overline{S}\\\\)</span> that minimizes the total weight of hyperedges that have at least two endpoints in two different sets. In the present study, we propose an approach that effectively solves the minimum <span>\\\\( s-t \\\\)</span> hypercut problem in (<i>s</i>, <i>t</i>)-planar hypergraphs. The method proposed demonstrates polynomial time complexity, providing a significant advancement in solving this problem. The modelling example shows that the proposed strategy is effective at obtaining balanced bipartitions in VLSI circuits.</p>\",\"PeriodicalId\":50231,\"journal\":{\"name\":\"Journal of Combinatorial Optimization\",\"volume\":\"9 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10878-024-01231-w\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-024-01231-w","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
摘要
平面超图被广泛应用于多个领域,包括超大规模集成电路设计、地铁地图、信息可视化和数据库。加权超图中的最小(s-t)超切问题是将顶点划分为两个非空集 S 和(overline{S}),其中(s在S中)和(t在overline{S}中)最小化至少有两个端点在两个不同集中的超通道的总重量。在本研究中,我们提出了一种有效解决(s, t)平面超图中最小(s-t)超切问题的方法。所提出的方法具有多项式时间复杂性,在解决这一问题方面取得了重大进展。建模实例表明,所提出的策略能有效地在超大规模集成电路中获得平衡双分区。
Minimum $$ s-t $$ hypercut in (s, t)-planar hypergraphs
Planar hypergraphs are widely used in several applications, including VLSI design, metro maps, information visualisation, and databases. The minimum \( s-t \) hypercut problem in a weighted hypergraph is to find a partition of the vertices into two nonempty sets, S and \( \overline{S} \), with \(s\in S\) and \(t\in \overline{S}\) that minimizes the total weight of hyperedges that have at least two endpoints in two different sets. In the present study, we propose an approach that effectively solves the minimum \( s-t \) hypercut problem in (s, t)-planar hypergraphs. The method proposed demonstrates polynomial time complexity, providing a significant advancement in solving this problem. The modelling example shows that the proposed strategy is effective at obtaining balanced bipartitions in VLSI circuits.
期刊介绍:
The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.
The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.