Inverse minimum hypercut problem in weighted hypergraphs

Given the hypergraph [Formula: see text] and an [Formula: see text]-hypercut [Formula: see text], an inverse minimum hypercut problem is to modify the weight vector [Formula: see text] so that [Formula: see text] becomes a minimum [Formula: see text]-hypercut and the modification is minimized. In this study, efficient algorithm is suggested for solving the inverse minimum hypercut problem, and the modification is measured by the [Formula: see text] norm. The applicability of the proposed method is demonstrated through VLSI circuits partitioning, highlighting their potential for practical optimization tasks in hypergraph-based models.

Authors

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2026-11-19
DOI
https://doi.org/10.1142/s179383092650117x
Primary Topic
Complexity and Algorithms in Graphs
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Inverse minimum hypercut problem in weighted hypergraphs

Massoud Aman, Abolfazl Hassanpour
Discrete Mathematics Algorithms and Applications
Complexity and Algorithms in Graphs
article

Inverse minimum hypercut problem in weighted hypergraphs

Massoud Aman, Abolfazl Hassanpour
article en

Abstract

Given the hypergraph [Formula: see text] and an [Formula: see text]-hypercut [Formula: see text], an inverse minimum hypercut problem is to modify the weight vector [Formula: see text] so that [Formula: see text] becomes a minimum [Formula: see text]-hypercut and the modification is minimized. In this study, efficient algorithm is suggested for solving the inverse minimum hypercut problem, and the modification is measured by the [Formula: see text] norm. The applicability of the proposed method is demonstrated through VLSI circuits partitioning, highlighting their potential for practical optimization tasks in hypergraph-based models.

Discrete Mathematics Algorithms and Applications
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon