Space-Efficient Parallel Algorithms for Combinatorial Search Problems

DOI10.1007/978-3-642-40313-2_63zbMath1398.68497arXiv1306.2552OpenAlexW1502325501MaRDI QIDQ2849956

Geppino Pucci, Fabio Vandin, Andrea Pietracaprina, Francesco Silvestri

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (1)

A nearly optimal randomized algorithm for explorable heap selection

This page was built for publication: Space-Efficient Parallel Algorithms for Combinatorial Search Problems