Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
The paper presents a general method of designing constant-factor approximation algorithms for some discrete optimization problems with assignment-type constraints. The core of the method is a simple deterministic procedure of rounding of linear relaxations (referred to as pipage rounding). With the help of the method we design approximation algorithms with better performance guarantees for some well-known problems including MAXIMUM COVERAGE, MAX CUT with given sizes of parts and some of their generalizations.
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
J. LaRue, C. Ting
Proceedings of SPIE 1989
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989
Andrew Skumanich
SPIE Optics Quebec 1993