๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Spectral Algorithms for Unique Games

โœ Scribed by Alexandra Kolla

Publisher
Springer
Year
2011
Tongue
English
Weight
359 KB
Volume
20
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms for discounted stochastic gam
Algorithms for discounted stochastic games
โœ S. S. Rao; R. Chandrasekaran; K. P. K. Nair ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Springer ๐ŸŒ English โš– 585 KB
Algorithms for non-convexSn-games
Algorithms for non-convexSn-games
โœ M. D. Troutt ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 592 KB
Evolutionary algorithms for flowshop seq
Evolutionary algorithms for flowshop sequencing with non-unique jobs
โœ R.L. Burdett; E. Kozan ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 207 KB

Sequencing problems are dicult combinatorial problems because of the extremely large search space of possible solutions and the large number of ``local'' optima that arise. Unlike other NP-hard combinatorial problems, the search space, in general, for sequencing problems (under the makespan objectiv

Approximation algorithms for NMR spectra
Approximation algorithms for NMR spectral peak assignment
โœ Zhi-Zhong Chen; Tao Jiang; Guohui Lin; Jianjun Wen; Dong Xu; Jinbo Xu; Ying Xu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 299 KB

We study a constrained bipartite matching problem where the input is a weighted bipartite graph G = (U; V; E), U is a set of vertices following a sequential order, V is another set of vertices partitioned into a collection of disjoint subsets, each following a sequential order, and E is a set of edg