scientific article; zbMATH DE number 1446756

zbMath0990.68183MaRDI QIDQ4953912

Ferenc Kruzslicz

Publication date: 14 May 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

greedy algorithmNP-completenessheuristic algorithmmedian string

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Related Items (3)

Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton ⋮ The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance ⋮ Computing the Expected Edit Distance from a String to a PFA

This page was built for publication: