Kovalev Michail M.

Michail M. Kovalev

Information about the author Michail M. Kovalev will soon be added to the site.
Found 1 papers in total
Greedy sets and related problems
1997
A set D is called greedy if the greedy algorithm solves the problem max { cx |...
Papers per page: