scientific article; zbMATH DE number 1305393

MaRDI QIDQ4252274zbMATH OpenFDO

Authors Reuven Bar-Yehuda

Publication date 12 December 2001

zbMATH Keywords

approximation algorithmlocal-ratioMin-Knapsack problempartial set cover problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Approximation algorithms (68W25)

Recommendations

• Using homogeneous weights for approximating the partial cover problem
• Approximation algorithms for partial covering problems
• Approximation algorithms for minimum weight partial connected set cover problem
• scientific article; zbMATH DE number 1754596

Cited in

(11)

• Computing small partial coverings
• Subexponential algorithms for partial cover problems
• On approximation of the submodular set cover problem
• An approximation algorithm for the partial covering 0-1 integer program
• Using homogeneous weights for approximating the partial cover problem
• An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem
• scientific article; zbMATH DE number 709680 (Why is no real title available?)
• Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
• Improved Upper Bounds for Partial Vertex Cover
• Approximation algorithms for minimum weight partial connected set cover problem
• Approximation algorithms for the partition vertex cover problem

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 Q4252274)