Query-competitive algorithms for cheapest set problems under uncertainty
type: Item
instance of: scholarly article
title: Query-competitive algorithms for cheapest set problems under uncertainty
zbMATH Open document ID: 1333.68300
author: N. E. Zubov
published in: Theoretical Computer Science
publication date: 2015-12-28T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6524280
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive analysis
zbMATH Keywords: verification
zbMATH Keywords: minimum multi-cut
zbMATH Keywords: matroid
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.11.025
OpenAlex ID: W2275305088
cites work: Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty
cites work: Q4910726
cites work: Efficient update strategies for geometric computing with uncertainty
cites work: Verification Problem of Maximal Points under Uncertainty
cites work: The update complexity of selection and related problems
cites work: Input-Thrifty Extrema Testing
cites work: Computing the Median with Uncertainty
cites work: Computing shortest paths with uncertainty
cites work: Q4967181
cites work: Largest and Smallest Tours and Convex Hulls for Imprecise Points
cites work: On minimum- and maximum-weight minimum spanning trees with neighborhoods
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: Primal-dual approximation algorithms for integral flow and multicut in trees
cites work: Fixed-parameter tractability and data reduction for multicut in trees
cites work: A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
cites work: Q4371290
cites work: A theorem on families of sets
DOI: 10.1016/J.TCS.2015.11.025
description: scientific article; zbMATH DE number 6524280