@InProceedings{cazaux_et_al:LIPIcs.SEA.2018.18,
  author =	{Cazaux, Bastien and Juhel, Samuel and Rivals, Eric},
  title =	{{Practical lower and upper bounds for the Shortest Linear Superstring}},
  booktitle =	{17th International Symposium on Experimental Algorithms (SEA 2018)},
  pages =	{18:1--18:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-070-5},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{103},
  editor =	{D'Angelo, Gianlorenzo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.18},
  URN =		{urn:nbn:de:0030-drops-89530},
  doi =		{10.4230/LIPIcs.SEA.2018.18},
  annote =	{Keywords: greedy, approximation, overlap, Concat-Cycles, cyclic cover, linear time, text compression}
}