𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational experience with an algorithm for discrete L1approximation

✍ Scribed by S. Baboolal; G. A. Watson

Publisher
Springer Vienna
Year
1981
Tongue
English
Weight
372 KB
Volume
27
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational experience with approximat
Computational experience with approximation algorithms for the set covering problem
✍ Tal Grossman; Avishai Wool πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 722 KB

The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of nine different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorith