"Randomized greedy algorithms for covering problems."

Wanru Gao et al. (2018)

Details and statistics

DOI: 10.1145/3205455.3205542

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics