Fast Witness Extraction Using a Decision Oracle

DOI10.1007/978-3-662-44777-2_13zbMath1423.68203arXiv1508.03572OpenAlexW2162591778MaRDI QIDQ2921401

Petteri Kaski, Łukasz Kowalik, Andreas Björklund

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.03572

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (6)

On finding rainbow and colorful paths ⋮ Spotting Trees with Few Leaves ⋮ Spotting Trees with Few Leaves ⋮ Randomised enumeration of small witnesses using a decision oracle ⋮ Turing kernelization for finding long paths and cycles in restricted graph classes ⋮ Many-visits TSP revisited

This page was built for publication: Fast Witness Extraction Using a Decision Oracle