Home /Research /Fast approximation algorithms for a nonconvex covering problem
OTHER

Fast approximation algorithms for a nonconvex covering problem

Dorit S. Hochbaum, Wolfgang Maass

Year
1987
Citations
44

Keywords

MathematicsBounded functionApproximation algorithmPolynomial-time approximation schemeDimension (graph theory)Context (archaeology)Degree (music)Scheme (mathematics)PolynomialAlgorithm

Related papers

Browse all OTHER papers