✦ LIBER ✦

A modified greedy heuristic for the Set Covering problem with improved worst case bound

✍ Scribed by Olivier Goldschmidt; Dorit S. Hochbaum; Gang Yu

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 458 KB
Volume: 48
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90173-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved worst-case complexity for the M

Improved worst-case complexity for the MIN 3-SET COVERING problem

✍ Federico Della Croce; Bruno Escoffier; Vangelis Th. Paschos 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 145 KB

A polynomial time heuristic for certain

A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound

✍ Svatopluk Poljak; Daniel Turzík 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 340 KB

We introduce a notion of ).-extendible property of graphs and prove: If P is a ).-extendible property (0<).<1), then for a connected graph G = (V, E) and an objective function c: E---\*R + one can construct a spanning subgraph H= (V, F) which has the property P and satisfies c(F) = ~. c(E) + ½