A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis

We consider the max hypergraph 3-cut problem with limited unbalance (MH3C-LU). The objective is to divide the vertex set of an edge-weighted hypergraph H = ( V , E , w ) into three disjoint subsets V 1 , V 2 , and V 3 such that the sum of edge weights cross different parts is maximized subject to |...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 87; číslo 2-4; s. 917 - 937
Hlavní autori:	Sun, Jian, Zhang, Zan-Bo, Chen, Yannan, Han, Deren, Du, Donglei, Zhang, Xiaoyan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2023 Springer
Predmet:	Algorithms Analysis Computer Science Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Real Functions Relaxation Complex semidefinite programming Randomized algorithm Approximation algorithm Max hypergraph 3-cut
ISSN:	0925-5001, 1573-2916
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!