An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding

Graph partition problems have been investigated extensively in combinatorial optimization. In this work, we consider an important graph partition problem which has applications in the design of VLSI circuits, namely, the balanced Max-3-Uncut problem . We formulate the problem as a discrete linear pr...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization Jg. 32; H. 4; S. 1017 - 1035
Hauptverfasser:	Wu, Chenchen, Xu, Dachuan, Du, Donglei, Xu, Wenqing
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2016 Springer Nature B.V
Schlagworte:	Algorithms Approximation Bivariate analysis Circuit design Combinatorial analysis Combinatorics Complex variables Convex and Discrete Geometry Integrated circuits Mathematical analysis Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Partitions (mathematics) Rounding Semidefinite programming Theory of Computation Complex semidefinite programming Approximation algorithm Balanced Max-3-Uncut
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!