scientific article; zbMATH DE number 7075885
From MaRDI portal
Publication:4967181
zbMath1409.68114MaRDI QIDQ4967181
No author found.
Publication date: 3 July 2019
Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/335/317
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Algorithms that access the input via queries ⋮ Scheduling with testing on multiple identical parallel machines ⋮ Query-competitive sorting with uncertainty ⋮ Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments ⋮ Round-competitive algorithms for uncertainty problems with parallel queries ⋮ Query-competitive algorithms for cheapest set problems under uncertainty ⋮ Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty ⋮ Algorithms for Queryable Uncertainty ⋮ A robust optimization approach with probe-able uncertainty ⋮ Query minimization under stochastic uncertainty ⋮ Query-Competitive Sorting with Uncertainty. ⋮ The Minimum Cost Query Problem on Matroids with Uncertainty Areas. ⋮ Randomization Helps Computing a Minimum Spanning Tree under Uncertainty ⋮ Explorable uncertainty in scheduling with non-uniform testing times
This page was built for publication: