✦ LIBER ✦

An approximation of the minimum vertex cover in a graph

✍ Scribed by Hiroshi Nagamochi; Toshihide Ibaraki

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finding a minimum vertex cover of a s

✍ Ioannis G. Tollis 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Approximation Algorithm Based on Chain I

✍ Jian-Xin Wang; Xiao-Shuang Xu; Jian-Er Chen 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 315 KB

A graph approximation heuristic for the

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

A simple LP-free approximation algorithm

✍ Teofilo F. Gonzalez 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 290 KB

A note on the minimum size of a vertex p

✍ H.J. Broersma 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 152 KB

The minimum size of graphs hamiltonian-c

✍ C.J. Knickerbocker; Patti Frazer Lock; Michael Sheard 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 136 KB