Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The greedy algorithm for the Shortest Common Superstring problem is a ..."

Pavel E. Kalugin, Maksim S. Nikolaev (2024)

> Home

Details and statistics

DOI: 10.1137/1.9781611977936.9

access: closed

type: Conference or Workshop Paper

metadata version: 2024-04-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sosa/KaluginN24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sosa/KaluginN24
Pavel E. Kalugin, Maksim S. Nikolaev:
The greedy algorithm for the Shortest Common Superstring problem is a ½-approximation in terms of compression: a simple proof. SOSA 2024: 97-99

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.