Learn to optimize from structured samples for minimum partial set cover

DOI10.1142/S1793830925500673MaRDI QIDQ7250430zbMATH OpenFDO

Authors Weizhi Hong, Yingli Ran, Zhao Zhang

Publication date 20 May 2026

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830925500673

zbMATH Keywords

approximation ratiopartial set coverstructured samples

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• Algorithms for facility location problems with outliers. (Extended abstract)
• Analytical approach to parallel repetition
• Approximation algorithms for combinatorial problems
• Approximation algorithms for partial covering problems
• scientific article; zbMATH DE number 1256748 (Why is no real title available?)
• Improved performance of the greedy algorithm for partial cover
• Learning submodular functions
• Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
• Reducibility among combinatorial problems
• The limitations of optimization from samples
• Using homogeneous weights for approximating the partial cover problem

This page was built for publication: Learn to optimize from structured samples for minimum partial set cover

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