scientific article; zbMATH DE number 6917137
From MaRDI portal
Publication:4580177
DOI10.4230/LIPIcs.SEA.2017.22zbMath1433.68293MaRDI QIDQ4580177
Julie Meißner, Nicole Megow, Jacob Focke
Publication date: 13 August 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Query-competitive sorting with uncertainty ⋮ Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments ⋮ Round-competitive algorithms for uncertainty problems with parallel queries ⋮ Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty ⋮ An adversarial model for scheduling with testing ⋮ A robust optimization approach with probe-able uncertainty ⋮ Query-Competitive Sorting with Uncertainty. ⋮ Scheduling with a processing time oracle
This page was built for publication:
