Жадный алгоритм в задачах о покрытии

Материал из DISCOPAL
Перейти к: навигация, поиск

Слайды «Жадный алгоритм в задачах о покрытии»

Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf Greedy-covering.beam.pdf


Записи лекций

2011

2008

Источник — «https://discopal.ispras.ru/index.php?title=Жадный_алгоритм_в_задачах_о_покрытии&oldid=4325»