Publication:3024773
From MaRDI portal
zbMath1063.68575MaRDI QIDQ3024773
S. Rao Kosaraju, Ryan S. Borgstrom, Teresa M. Przytycka
Publication date: 4 July 2005
Related Items
Adaptive Submodular Ranking and Routing, Running Errands in Time: Approximation Algorithms for Stochastic Orienteering, Unnamed Item, Improved approximation algorithms for the average-case tree searching problem, An approximation algorithm for binary searching in trees, On the complexity of searching in trees and partially ordered structures, Decision trees for function evaluation: simultaneous optimization of worst and expected cost, Trading off worst and expected cost in decision tree problems, Approximating decision trees with value dependent testing costs, Approximating optimal binary decision trees, Scenario Submodular Cover, Average-Case Active Learning with Costs