Algorithms for the Generalized Poset Sorting Problem

04/04/2023
โˆ™
by   Shaofeng H. -C. Jiang, et al.
โˆ™
0
โˆ™

We consider a generalized poset sorting problem (GPS), in which we are given a query graph G = (V, E) and an unknown poset ๐’ซ(V, โ‰บ) that is defined on the same vertex set V, and the goal is to make as few queries as possible to edges in G in order to fully recover ๐’ซ, where each query (u, v) returns the relation between u, v, i.e., u โ‰บ v, v โ‰บ u or u โ‰v. This generalizes both the poset sorting problem [Faigle et al., SICOMP 88] and the generalized sorting problem [Huang et al., FOCS 11]. We give algorithms with ร•(nยทpoly(k)) query complexity when G is a complete bipartite graph or G is stochastic under the model, where k is the width of the poset, and these generalize [Daskalakis et al., SICOMP 11] which only studies complete graph G. Both results are based on a unified framework that reduces the poset sorting to partitioning the vertices with respect to a given pivot element, which may be of independent interest. Our study of GPS also leads to a new ร•(n^1 - 1 / (2W)) competitive ratio for the so-called weighted generalized sorting problem where W is the number of distinct weights in the query graph. This problem was considered as an open question in [Charikar et al., JCSS 02], and our result makes important progress as it yields the first nontrivial ร•(n) ratio for general weighted query graphs (and better ratio if W is bounded). We obtain this via an ร•(nk + n^1.5) query complexity algorithm for the case where every edge in G is guaranteed to be comparable in the poset, which generalizes the state-of-the-art ร•(n^1.5) bound for generalized sorting [Huang et al., FOCS 11].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
โˆ™ 02/14/2020

A Simple 1-1/e Approximation for Oblivious Bipartite Matching

We study the oblivious matching problem, which aims at finding a maximum...
research
โˆ™ 07/06/2022

Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries

We study the problem of estimating the number of edges in an n-vertex gr...
research
โˆ™ 11/06/2018

The entropy of lies: playing twenty questions with a liar

`Twenty questions' is a guessing game played by two players: Bob thinks ...
research
โˆ™ 12/17/2020

Query-Competitive Sorting with Uncertainty

We study the problem of sorting under incomplete information, when queri...
research
โˆ™ 01/23/2020

Sorting Permutations with Fixed Pinnacle Set

We give a positive answer to a question raised by Davis et al. ( Discret...
research
โˆ™ 03/16/2023

Optimal Intervention on Weighted Networks via Edge Centrality

Suppose there is a spreading process such as an infectious disease propa...
research
โˆ™ 07/12/2021

Noisy searching: simple, fast and correct

This work revisits the multiplicative weights update technique (MWU) whi...

Please sign up or login with your details

Forgot password? Click here to reset