13 citations · 17 across the 5 of their papers we have counts for
1 paper · 2 filters
Marek Karpinski, Richard Schmied
We study the approximation hardness of the Shortest Superstring, the Maximal Compression and the Maximum Asymmetric Traveling Salesperson (MAX-ATSP) problem. We introduce a new red…