Approximation Algorithms for Union and Intersection Covering Problems
From MaRDI portal
Publication:2911607
DOI10.4230/LIPICS.FSTTCS.2011.28zbMath1246.68118OpenAlexW2160296932MaRDI QIDQ2911607
Publication date: 31 August 2012
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2011.28
Descriptive complexity and finite models (68Q19) Quantum algorithms and complexity in the theory of computing (68Q12)
This page was built for publication: Approximation Algorithms for Union and Intersection Covering Problems