3 citations · 4 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Pairing optimization via statistics: Algebraic structure in pairing problems and its application to performance enhancement
Naoki Fujita, André Röhm, Takatomo Mihana +4
Fully pairing all elements of a set while attempting to maximize the total benefit is a combinatorically difficult problem. Such pairing problems naturally appear in various situat…
cs.DS2022
Efficient Pairing in Unknown Environments: Minimal Observations and TSP-based Optimization
Naoki Fujita, Nicolas Chauvet, Andre Roehm +4
Generating paired sequences with maximal compatibility from a given set is one of the most important challenges in various applications, including information and communication tec…