Improved Lower Bounds for the Shortest Superstring and Related Problems

@article{Karpinski2011ImprovedLB,
  title={Improved Lower Bounds for the Shortest Superstring and Related Problems},
  author={Marek Karpinski and Richard Schmied},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2011},
  volume={18},
  pages={156}
}
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 reduction method that produces strongly restricted instances of the Shortest Superstring problem, in which the maximal orbit size is eight (with no character appearing more than eight times) and all given strings having length at most six. Based on this reduction method, we are able to improve the best up to now known… CONTINUE READING

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 31 REFERENCES

Lyndon Words and Short Superstrings

  • SODA
  • 2012
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Nemhauser and L . Wolsey , An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit

G. M. Fisher
  • Oper . Res .
  • 2006

Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size

S. Ott
  • Proc. 25th. WG
  • 1999

On Some Tighter Inapproximability Results

  • Electronic Colloquium on Computational Complexity
  • 1998