Monotonicity Testing and Shortest-Path Routing on the Cube
DOI10.1007/978-3-642-15369-3_35zbMath1305.68134OpenAlexW1489273001MaRDI QIDQ3588427
David García-Soriano, Sourav Chakraborty, Arie Matsliah, Jop Briët
Publication date: 10 September 2010
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_35
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (1)
This page was built for publication: Monotonicity Testing and Shortest-Path Routing on the Cube
