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
- Massoud Aman (ORCID: https://orcid.org/0000-0001-7636-890X)
- Abolfazl Hassanpour
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