✦ LIBER ✦

A list heuristic for vertex cover

✍ Scribed by David Avis; Tomokazu Imamura

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A graph approximation heuristic for the

✍ D.L. Meek; R. Gary Parker 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 684 KB

A lagrangian heuristic for set-covering

✍ J. E. Beasley 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 662 KB

A surrogate heuristic for set covering p

✍ Luiz Antonio N. Lorena; Fábio Belo Lopes 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 733 KB

Test Sets for Vertex Cover Problems

✍ M. Hayer; W. Hochstättler 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 93 KB

A Lagrangean heuristic for the maximal c

✍ Roberto Diéguez Galvão; Charles ReVelle 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 802 KB

Approximation algorithm for weighted wea

✍ Yong Zhang; Hong Zhu 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 381 KB