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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of combinatorial optimization Ročník 32; číslo 4; s. 1017 - 1035
Hlavní autoři:	Wu, Chenchen, Xu, Dachuan, Du, Donglei, Xu, Wenqing
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.11.2016 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!