5 citations · 14 across the 10 of their papers we have counts for
5 papers · 1 filter
Minimum-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
Vladimir Deineko, Alexander Tiskin
The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of T…
Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?
Vladimir Deineko, Alexander Tiskin
The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of T…
Faster exon assembly by sparse spliced alignment
Alexander Tiskin
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is \emph{spliced alignment}, proposed…
Semi-local string comparison: algorithmic techniques and applications
Alexander Tiskin
A classical measure of string comparison is given by the longest common subsequence (LCS) problem on a pair of strings. We consider its generalisation, called the semi-local LCS pr…
Faster subsequence recognition in compressed strings
Alexander Tiskin
Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight…