1 citations · 1 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
Online MinCut: Competitive and Regret Analysis
Avah Banerjee, Guoli Ding
In this paper we study the mincut problem in the online setting. We consider two distinct models: A) competitive analysis and B) regret analysis. In the competitive setting we cons…
cs.DS2018
Oblivious Set-maxima for Intersection of Convex Polygons
Avah Banerjee, Dana Richards
In this paper we revisit the well known set-maxima problem in the oblivious setting. Let be a set of elements with an underlying total order. Let $\math…