𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximate graph coloring by semidefinite programming

✍ Scribed by Karger, David; Motwani, Rajeev; Sudan, Madhu

Book ID
126809050
Publisher
Association for Computing Machinery
Year
1998
Tongue
English
Weight
153 KB
Volume
45
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation Algorithms and Semidefinit
Approximation Algorithms and Semidefinite Programming || Coloring 3-Chromatic Graphs
✍ GΓ€rtner, Bernd; Matousek, Jiri πŸ“‚ Article πŸ“… 2011 πŸ› Springer Berlin Heidelberg 🌐 German βš– 186 KB

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit

Approximation Algorithms and Semidefinit
Approximation Algorithms and Semidefinite Programming || Approximately Solving Semidefinite Programs
✍ GΓ€rtner, Bernd; Matousek, Jiri πŸ“‚ Article πŸ“… 2011 πŸ› Springer Berlin Heidelberg 🌐 German βš– 317 KB

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit

Approximation Algorithms and Semidefinit
Approximation Algorithms and Semidefinite Programming || Semidefinite Programming
✍ GΓ€rtner, Bernd; Matousek, Jiri πŸ“‚ Article πŸ“… 2011 πŸ› Springer Berlin Heidelberg 🌐 German βš– 185 KB

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit

Approximation Algorithms and Semidefinit
Approximation Algorithms and Semidefinite Programming || Colorings with Low Discrepancy
✍ GΓ€rtner, Bernd; Matousek, Jiri πŸ“‚ Article πŸ“… 2011 πŸ› Springer Berlin Heidelberg 🌐 German βš– 204 KB

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexit