scientific article; zbMATH DE number 1855640

zbMATH Open1009.68196MaRDI QIDQ4788041FDOQ4788041

Authors: A. V. Prolubnikov 

Publication date: 19 January 2003

Title of this publication is not available (Why is that?)

Recommendations

• A threshold of ln n for approximating set cover
• scientific article; zbMATH DE number 1256748
• A heuristic algorithm for the multi-criteria set-covering problems
• A modified greedy heuristic for the set covering problem with improved worst case bound
• A Tight Analysis of the Greedy Algorithm for Set Cover

zbMATH Keywords

cost functiongreedy heuristic for the set-covering problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4788041)