6 citations · 9 across the 13 of their papers we have counts for
4 papers · 1 filter
Solving -Stable Instances of k-Terminal Cut with Isolating Cuts
Mark Velednitsky
The k-Terminal Cut problem, also known as the Multiway Cut problem, is defined on an edge-weighted graph with distinct vertices called "terminals." The goal is to remove a mini…
Algorithms and Complexity of Range Clustering
Dorit S. Hochbaum
We introduce a novel criterion in clustering that seeks clusters with limited range of values associated with each cluster's elements. In clustering or classification the objective…
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
Minjun Chang, Dorit S. Hochbaum, Quico Spaen +1
This work presents an optimally-competitive algorithm for the problem of maximum weighted online perfect bipartite matching with i.i.d. arrivals. In this problem, we are given a kn…
Efficient algorithms to discover alterations with complementary functional association in cancer
Rebecca Sarto Basso, Dorit S. Hochbaum, Fabio Vandin
Recent large cancer studies have measured somatic alterations in an unprecedented number of tumours. These large datasets allow the identification of cancer-related sets of genetic…