Marcin Bienkowski
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Algorithms×1
Frequent co-authors
Research Timeline
2026
Incremental Submodular Maximization: Better Than Greedy
The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best result of e/(e-1) ≈ 1.582.
Highlighted terms show continued research focus across papers