Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Hassanpour et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: