𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The set union problem with dynamic weighted backtracking

✍ Scribed by Giorgio Gambosi; Giuseppe F. Italiano; Maurizio Talamo

Book ID
105403202
Publisher
Springer Netherlands
Year
1991
Tongue
English
Weight
884 KB
Volume
31
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Note: On the set-union knapsack problem
Note: On the set-union knapsack problem
✍ Olivier Goldschmidt; David Nehme; Gang Yu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 558 KB
A generalization of the weighted set cov
A generalization of the weighted set covering problem
✍ Jian Yang; Joseph Y-T. Leung πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,

Preserving approximation in the Minβ€”Weig
Preserving approximation in the Minβ€”Weighted Set Cover Problem
✍ Giorgio Gambosi; Marco Protasi; Maurizio Talamo πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 616 KB

In this paper we prove that the approximate solutions to the Min-Weighted Set Cover Problem provided by Chvatal's algorithm are combinatorially k-stable with respect to element insertions. Intuitively speaking, we define an approximate solution as combinatorially k-stable with respect to an update