Query-Competitive Sorting with Uncertainty

12/17/2020
by   Magnus M. Halldorsson, et al.
0

We study the problem of sorting under incomplete information, when queries are used to resolve uncertainties. Each of n data items has an unknown value, which is known to lie in a given interval. We can pay a query cost to learn the actual value, and we may allow an error threshold in the sorting. The goal is to find a nearly-sorted permutation by performing a minimum-cost set of queries. We show that an offline optimum query set can be found in poly time, and that both oblivious and adaptive problems have simple competitive algorithms. The competitive ratio for the oblivious problem is n for uniform query costs, and unbounded for arbitrary costs; for the adaptive problem, the ratio is 2. We present a unified adaptive strategy for uniform costs that yields the following improved results: (1) a 3/2-competitive randomized algorithm; (2) a 5/3-competitive deterministic algorithm if the dependency graph has no 2-components after some preprocessing, which has competitive ratio 3/2+O(1/k) if the components obtained have size at least k; and (3) an exact algorithm for laminar families of intervals. The first two results have matching lower bounds, and we have a lower bound of 7/5 for large components. We also give a randomized adaptive algorithm with competitive ratio 1+4/3√(3)≈ 1.7698 for arbitrary query costs, and we show that the 2-competitive deterministic adaptive algorithm can be generalized for queries returning intervals and for a more general vertex cover problem, by using the local ratio technique. Moreover, we prove that the advice complexity of the adaptive problem is ⌊ n/2⌋ if no error threshold is allowed, and ⌈ n/3· 3⌉ for the general case. Finally, we present some graph-theoretical results on co-threshold tolerance graphs, and we discuss uncertainty variants of some classical interval problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2021

Orienting (hyper)graphs under explorable stochastic uncertainty

Given a hypergraph with uncertain node weights following known probabili...
research
10/07/2020

Query Minimization under Stochastic Uncertainty

We study problems with stochastic uncertainty information on intervals f...
research
04/04/2023

Algorithms for the Generalized Poset Sorting Problem

We consider a generalized poset sorting problem (GPS), in which we are g...
research
11/08/2022

Universal Sorting: Finding a DAG using Priced Comparisons

We resolve two open problems in sorting with priced information, introdu...
research
01/13/2021

Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries

The area of computing with uncertainty considers problems where some inf...
research
11/22/2020

Online Maximum k-Interval Coverage Problem

We study the online maximum coverage problem on a line, in which, given ...
research
03/19/2019

Preprocessing Ambiguous Imprecise Points

Let R = {R_1, R_2, ..., R_n} be a set of regions and let X = {x_1, x_2,...

Please sign up or login with your details

Forgot password? Click here to reset