3 citations · 6 across the 6 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CG2020
Improved Algorithm for Computing the Maximum-volume Bichromatic Separating Box
Bogdan Armaselu
We consider the problem of computing the largest-area bichromatic separating box among a set of red points and a set of blue points in three dimensions. Currently, the best…
cs.DS2020★ 1 cited
An APX for the Maximum-Profit Routing Problem with Variable Supply
Bogdan Armaselu
In this paper, we study the Maximum-Profit Routing Problem with Variable Supply (MPRP-VS). This is a more general version of the Maximum-Profit Public Transportation Route Planning…