Greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings.
| Anthology ID: | DBLP:conf/spire/Nikolaev24 |
|---|---|
| Volume: | String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings |
| Year: | 2024 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 233-248 |
| URL: | https://doi.org/10.1007/978-3-031-72200-4_18 |
| DOI: | https://doi.org/10.1007/978-3-031-72200-4_18 |
| DBLP: | conf/spire/Nikolaev24 |
| BibTeX: |
@inproceedings{nikolaev-2024-greedy,
author = {Maksim S. Nikolaev},
editor = {Zsuzsanna Lipt\'{a}k and
Edleno Silva de Moura and
Karina Figueroa and
Ricardo Baeza-Yates},
title = {{Greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings}},
booktitle = {{String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {14899},
pages = {233--248},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-72200-4_18},
doi = {https://doi.org/10.1007/978-3-031-72200-4_18}
}