scientific article; zbMATH DE number 6146462
From MaRDI portal
Publication:4910726
DOI10.4230/LIPIcs.STACS.2008.1358zbMath1259.68161MaRDI QIDQ4910726
No author found.
Publication date: 19 March 2013
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_c02b.html
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 (25)
Algorithms that access the input via queries ⋮ Scheduling with testing on multiple identical parallel machines ⋮ Two-stage robust optimization problems with two-stage uncertainty ⋮ Randomization Helps Computing a Minimum Spanning Tree under Uncertainty ⋮ The update complexity of selection and related problems ⋮ The robust knapsack problem with queries ⋮ Query-competitive sorting with uncertainty ⋮ Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments ⋮ Unnamed Item ⋮ Set selection under explorable stochastic uncertainty via covering techniques ⋮ 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 ⋮ An adversarial model for scheduling with testing ⋮ Algorithms for Queryable Uncertainty ⋮ A robust optimization approach with probe-able uncertainty ⋮ Query minimization under stochastic uncertainty ⋮ Optimal path discovery problem with homogeneous knowledge ⋮ Query-Competitive Sorting with Uncertainty. ⋮ The Minimum Cost Query Problem on Matroids with Uncertainty Areas. ⋮ Minimizing Co-location Potential of Moving Entities ⋮ Randomization Helps Computing a Minimum Spanning Tree under Uncertainty ⋮ On minimum- and maximum-weight minimum spanning trees with neighborhoods ⋮ Scheduling with a processing time oracle ⋮ Explorable uncertainty in scheduling with non-uniform testing times
This page was built for publication:
