𝔖 Bobbio Scriptorium

✦ LIBER ✦

On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function

✍ Scribed by E. de Klerk; D.V. Pasechnik; J.P. Warners

Book ID: 111592096
Publisher: Springer US
Year: 2004
Tongue: English
Weight: 187 KB
Volume: 8
Category: Article
ISSN: 1382-6905
DOI: 10.1023/b:joco.0000038911.67280.3f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exact and approximation algorithms for t

Exact and approximation algorithms for the min–max k-traveling salesmen problem on a tree

✍ Xu, Liang; Xu, Zhou; Xu, Dongsheng 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 565 KB

[IEEE 2011 Fourth International Symposiu

[IEEE 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP) - Tianjin, China (2011.12.9-2011.12.11)] 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming - A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph

✍ Zhu, Wenxing; Guo, Chuanyin 📂 Article 📅 2011 🏛 IEEE ⚖ 406 KB

[ACM Press the twenty-eighth annual ACM

[ACM Press the twenty-eighth annual ACM symposium - Philadelphia, Pennsylvania, United States (1996.05.22-1996.05.24)] Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 - Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING

✍ Klein, Philip; Lu, Hsueh-I 📂 Article 📅 1996 🏛 ACM Press 🌐 English ⚖ 862 KB

[ACM Press the 12th annual conference -

[ACM Press the 12th annual conference - Portland, Oregon, USA (2010.07.07-2010.07.11)] Proceedings of the 12th annual conference on Genetic and evolutionary computation - GECCO '10 - Indicator-based evolutionary algorithm with hypervolume approximation by achievement scalarizing functions

✍ Ishibuchi, Hisao; Tsukamoto, Noritaka; Sakane, Yuji; Nojima, Yusuke 📂 Article 📅 2010 🏛 ACM Press ⚖ 745 KB