Efficient approximation of Min Set Cover by moderately exponential algorithms

From MaRDI portal
Publication:1019736

DOI10.1016/j.tcs.2009.02.007zbMath1166.68043OpenAlexW2009411756MaRDI QIDQ1019736

Bruno Escoffier, Vangelis Th. Paschos, Nicolas Bourgeois

Publication date: 28 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.fr/handle/123456789/2098




Related Items (14)



Cites Work


This page was built for publication: Efficient approximation of Min Set Cover by moderately exponential algorithms