31 citations · 31 across the 3 of their papers we have counts for
3 papers
cs.DS2013
Counting small cuts in a graph
Barbara Geissmann, Rastislav Šrámek
We study the minimum cut problem in the presence of uncertainty and show how to apply a novel robust optimization approach, which aims to exploit the similarity in subsequent graph…
cs.DS2013
Counting approximately-shortest paths in directed acyclic graphs
Matúš Mihalák, Rastislav Šrámek, Peter Widmayer
Given a directed acyclic graph with positive edge-weights, two vertices s and t, and a threshold-weight L, we present a fully-polynomial time approximation-scheme for the problem o…
cs.DS2007★ 31 cited
On-line Viterbi Algorithm and Its Relationship to Random Walks
Rastislav Šrámek, Broňa Brejová, Tomáš Vinař
In this paper, we introduce the on-line Viterbi algorithm for decoding hidden Markov models (HMMs) in much smaller than linear space. Our analysis on two-state HMMs suggests that t…