3 citations · 5 across the 9 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
Alexander Turoczy, Young-San Lin
We study the online multi-level aggregation problem with deadlines (MLAP-D) introduced by Bienkowski et al. (ESA 2016, OR 2020). In this problem, requests arrive over time at the v…
cs.GT2025
A few good choices
Thanh Nguyen, Haoyu Song, Young-San Lin
A Condorcet winning set addresses the Condorcet paradox by selecting a few candidates--rather than a single winner--such that no unselected alternative is preferred to all of them…