A near optimal algorithm for the extended cow-path problem in the presence of relative errors

DOI10.1007/3-540-60692-0_38zbMath1354.68238OpenAlexW1560089804MaRDI QIDQ2956671

Pallas Dasgupta, S. C. de Sarkar, Partha Pratim Chakrabarti

Publication date: 19 January 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60692-0_38

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

A nearly optimal randomized algorithm for explorable heap selection

This page was built for publication: A near optimal algorithm for the extended cow-path problem in the presence of relative errors