Query-competitive algorithms for cheapest set problems under uncertainty
Authors:
- Thomas ErlebachTEThomas Erlebach
- Michael HoffmannMHMichael Hoffmann
- Frank KammerFKFrank Kammer
- 1 February 2016
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 613, 51-64
Abstract
No abstract availableKeywords
Funding Information
- University of Leicester
This publication has 8 references indexed in Scilit:
- On Minimum- and Maximum-Weight Minimum Spanning Trees with NeighborhoodsTheory of Computing Systems, 2014
- Min–max and min–max regret versions of combinatorial optimization problems: A surveyEuropean Journal of Operational Research, 2009
- Computing shortest paths with uncertaintyJournal of Algorithms, 2007
- Fixed‐parameter tractability and data reduction for multicut in treesNetworks, 2005
- Efficient Update Strategies for Geometric Computing with UncertaintyTheory of Computing Systems, 2005
- Computing the Median with UncertaintySIAM Journal on Computing, 2003
- Primal-dual approximation algorithms for integral flow and multicut in treesAlgorithmica, 1997
- A theorem on families of setsJournal of Combinatorial Theory, Series A, 1972