Improved inapproximability results for the shortest superstring and related problems

Authors:
Marek Karpinski;Richard Schmied
Affiliations:
University of Bonn;University of Bonn
Venue:
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Year:
2013

Citing 15
Cited 1

Data compression: methods and theory

Data compression: methods and theory
An approximation algorithm for the asymmetric travelling salesman problem with distances one and two

Information Processing Letters
The traveling salesman problem with distances one and two

Mathematics of Operations Research
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Some optimal inapproximability results

Journal of the ACM (JACM)
When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree

SIAM Journal on Computing
On Some Tighter Inapproximability Results (Extended Abstract)

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximating Bounded Degree Instances of NP-Hard Problems

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Journal of the ACM (JACM)
8/7-approximation algorithm for (1,2)-TSP

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
TSP with bounded metrics

Journal of Computer and System Sciences
On The Approximability Of The Traveling Salesman Problem

Combinatorica
Towards a DNA sequencing theory (learning a string)

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Explicit inapproximability bounds for the shortest superstring problem

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Guest column: the elusive inapproximability of the TSP

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a new method for proving explicit approximation lower bounds for the Shortest Superstring problem, the Maximum Compression problem, the Maximum Asymmetric TSP problem, the (1, 2)--ATSP problem and the (1, 2)--TSP problem improving on the best known approximation lower bounds for those problems.