Finding witnesses by peeling

DOI10.1145/1921659.1921670zbMath1295.68226OpenAlexW2085888776MaRDI QIDQ3189006

Dekel Tsur, Yonatan Aumann, Noa Lewenstein, Moshe Lewenstein

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1921659.1921670

zbMATH Keywords

shortest pathswitness computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms on strings (68W32)

Related Items (3)

Faster algorithms for \(k\)-\textsc{Subset Sum} and variations ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ Faster algorithms for \(k\)-subset sum and variations

This page was built for publication: Finding witnesses by peeling