✦ LIBER ✦

Test Sets for Vertex Cover Problems

✍ Scribed by M. Hayer; W. Hochstättler

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 93 KB
Volume: 3
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80028-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient bounds for the stable set, ver

Efficient bounds for the stable set, vertex cover and set packing problems

✍ Dorit S. Hochbaum 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 802 KB

On approximation problems related to the

On approximation problems related to the independent set and vertex cover problems

✍ R. Bar-Yehuda; S. Moran 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 549 KB

An algorithm for set covering problem

✍ J.E. Beasley 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 763 KB

On locally optimal independent sets and

On locally optimal independent sets and vertex covers

✍ Gang Yu; Olivier Goldschmidt 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 665 KB

In this paper, we introduce a new notion of local optimality and demonstrate its application to the problem of finding optimal independent sets and vertex covers in k-claw free graphs. The maximum independent set problem in k-claw free graphs has interesting applications in the design of electronic

A parallel algorithm for the minimum wei

A parallel algorithm for the minimum weighted vertex cover problem

✍ Aristidis Likas; Andreas Stafylopatis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 522 KB

A lagrangian heuristic for set-covering

A lagrangian heuristic for set-covering problems

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