首页 /研究 /Fast approximation algorithms for a nonconvex covering problem
OTHER

Fast approximation algorithms for a nonconvex covering problem

Dorit S. Hochbaum, Wolfgang Maass

发表年份
1987
引用次数
44

关键词

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

相关论文

查看 OTHER 分类全部论文