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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 85; H. 2; S. 406 - 443
Hauptverfasser:	Erlebach, Thomas, Hoffmann, Michael, de Lima, Murilo Santos
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.02.2023 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!