5 citations · 14 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019★ 2 cited
Fully Dynamic k-Center Clustering in Doubling Metrics
Gramoz Goranci, Monika Henzinger, Dariusz Leniowski +2
Clustering is one of the most fundamental problems in unsupervised learning with a large number of applications. However, classical clustering algorithms assume that the data is st…
cs.DS2018
Algorithms and Conditional Lower Bounds for Planning Problems
Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger +1
We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction wi…