Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries

In computing with explorable uncertainty, one considers problems where the values of some input elements are uncertain, typically represented as intervals, but can be obtained using queries. Previous work has considered query minimization in the settings where queries are asked sequentially (adaptiv...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 85; no. 2; pp. 406 - 443
Main Authors:	Erlebach, Thomas, Hoffmann, Michael, de Lima, Murilo Santos
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2023 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Lower bounds Mathematics of Computing Optimization Queries Sorting algorithms Theory of Computation Uncertainty Online algorithms Selection problem 68W40 Competitive analysis 68W10 Explorable uncertainty Minimum problem Parallel algorithms Sorting problem
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!