trends.barnas.net

method · first seen 13 Oct 2026

greedy approximation algorithm

Polynomial-time algorithm that makes locally optimal choices at each step, with provable approximation guarantees for NP-hard optimization problems.

Mentions per week

0119 May11 Aug10 NovPapersCodeDiscussion

PapersCodeDiscussion

Earliest sources

Latest sources

Mentioned together with

multi-armed bandit