scientific article

From MaRDI portal

Revision as of 21:36, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3024773

Jump to:navigation, search

zbMath1063.68575MaRDI QIDQ3024773

S. Rao Kosaraju, Ryan S. Borgstrom, Teresa M. Przytycka

Publication date: 4 July 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Approximation algorithms (68W25)

Related Items (12)

Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ Trading off worst and expected cost in decision tree problems ⋮ Approximating optimal binary decision trees ⋮ An approximation algorithm for binary searching in trees ⋮ Scenario Submodular Cover ⋮ Adaptive Submodular Ranking and Routing ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Average-Case Active Learning with Costs ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ Unnamed Item ⋮ Approximating decision trees with value dependent testing costs

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3024773&oldid=16052046"