arXiv (All)
open access
Disproving the Greedy Superstring Conjecture
The shortest common superstring problem is to find the shortest string that contains every string in a given set as a substring. It is conjectured that the greedy algorithm that repeatedly selects a pair of strings with maximum overlap and merges them is a $2$-approximation algorithm, and this conje
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
- A Proof of the Tratnik-Ye Medianity Conjecture of Resonance Graphs on Surfaces#1070497
- The Price of Feasibility: Greedy Approximation Bounds for String Supermodular Optimization over Oracle-Conditioned Greedoids#984682
- Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction#622493
- 47 U.S.C. § 1451 — Deadlines for auction of certain spectrum#597738
- Query Complexity of Testing Structured Parenthesis Languages#1141753
Record · ID 821306
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