Publication:4723187

zbMath0615.65070MaRDI QIDQ4723187

Aurel Galantai

Publication date: 1985

zbMATH Keywords

complexity measure; Lehmer-Schur method; Near optimal covering algorithms

Mathematics Subject Classification ID

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

05B40: Combinatorial aspects of packing and covering

65K99: Numerical methods for mathematical programming, optimization and variational techniques

Related Items

Improving a method of search for solving polynomial equations