{"version":"1.0","type":"link","title":"Covering problems - Newikis","description":"In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that. Covering problems are minimization problems and usually integer linear programs, whose dual…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}