37 citations · 164 across the 32 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013★ 1 cited
Efficiently Computing Edit Distance to Dyck Language
Barna Saha
Given a string over alphabet and a grammar defined over the same alphabet, how many minimum number of repairs: insertions, deletions and substitutions are required to m…
cs.DS2013★ 4 cited
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median
Mohammadtaghi Hajiaghayi, Wei Hu, Jian Li +2
In this paper, we consider the fault-tolerant -median problem and give the \emph{first} constant factor approximation algorithm for it. In the fault-tolerant generalization of c…