arXiv (All)
open access
A Tight Cycle-Cover Inequality for Shortest Common Superstring
In the Shortest Common Superstring problem (SCS), one is given a finite set of strings and is asked to find a shortest string containing every input string as a substring. Its best known approximation ratio is $2.466$, whereas the currently strongest upper bound on the approximation guarantee of the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Realizability of Edge-Girth Sequences#1142754
- Improved bounds for Szpiro's conjecture#1123755
- A Minimal Upper Bound on a Sequence of Turing Degrees Which Represents that Sequence#87166
- Envelopes of upper bounds for nonbinary constant-weight and constant-composition codes#1050060
- NIST SP 800-236: Fiscal Year 2024 Cybersecurity and Privacy Annual Report#2987
Record · ID 1064465
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive