✦ LIBER ✦

A semidefinite programming-based heuristic for graph coloring

✍ Scribed by Igor Dukanovic; Franz Rendl

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semidefinite programming relaxations for

✍ Igor Dukanovic; Franz Rendl 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 245 KB

A Range-Compaction Heuristic for Graph C

✍ Andrea Di Blas; Arun Jagota; Richard Hughey 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 195 KB

Classification analysis of heuristic alg

✍ A. A. Shneider 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 958 KB

Probabilistic analysis of a heuristic gr

✍ Tsuyoshi Kawaguchi; Hideo Nakano; Yoshiro Nakanishi 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB

A graph coloring constructive hyper-heur

✍ Nasser R. Sabar, Masri Ayob, Rong Qu, Graham Kendall 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 450 KB

Graph partitioning using linear and semi

✍ A. Lisser; F. Rendl 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 92 KB