Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty

DOI10.1007/978-3-662-44465-8_23zbMath1333.68299OpenAlexW232024102MaRDI QIDQ2922614

No author found.

Publication date: 14 October 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_23

Mathematics Subject Classification ID

Trees (05C05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Randomization Helps Computing a Minimum Spanning Tree under Uncertainty ⋮ Query-competitive algorithms for cheapest set problems under uncertainty

This page was built for publication: Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty