Algorithms for the Generalized Poset Sorting Problem

Authors Shaofeng H.-C. Jiang , Wenqian Wang , Yubo Zhang , Yuhao Zhang



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.92.pdf
  • Filesize: 0.78 MB
  • 15 pages

Document Identifiers

Author Details

Shaofeng H.-C. Jiang
  • School of Computer Science, Peking University, Beijing, China
Wenqian Wang
  • School of Electronic, Information and Electrical Engineering, Shanghai Jiao Tong University, China
Yubo Zhang
  • School of Computer Science, Peking University, Beijing, China
Yuhao Zhang
  • John Hopcroft Center for Computer Science, Shanghai Jiao Tong University, China

Cite AsGet BibTex

Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, and Yuhao Zhang. Algorithms for the Generalized Poset Sorting Problem. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 92:1-92:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.92

Abstract

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 Erdős-Rényi 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. Moreover, we also propose novel algorithms to implement this partition oracle. Notably, we suggest a randomized BFS with vertex skipping for the stochastic G, and it yields a nearly-tight bound even for the special case of generalized sorting (for stochastic G) which is comparable to the main result of a recent work [Kuszmaul et al., FOCS 21] but is conceptually different and simplified. 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 sublinear ratio for general weighted query graphs (for any bounded W). 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 a Õ(n^{1.5}) bound for generalized sorting [Huang et al., FOCS 11].

Subject Classification

ACM Subject Classification
  • Theory of computation → Sorting and searching
  • Theory of computation → Online algorithms
Keywords
  • sorting
  • poset sorting
  • generalized sorting

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, and Rafail Ostrovsky. Matching nuts and bolts. In SODA, pages 690-696. ACM/SIAM, 1994. Google Scholar
  2. Noga Alon, Phillip G. Bradford, and Rudolf Fleischer. Matching nuts and bolts faster. Inf. Process. Lett., 59(3):123-127, 1996. Google Scholar
  3. Stanislav Angelov, Keshav Kunal, and Andrew McGregor. Sorting and selection with random costs. In LATIN, volume 4957 of Lecture Notes in Computer Science, pages 48-59. Springer, 2008. Google Scholar
  4. Indranil Banerjee and Dana Richards. Sorting under 1-∞ cost model. CoRR, abs/1508.03698, 2015. Google Scholar
  5. Indranil Banerjee and Dana S. Richards. Sorting under forbidden comparisons. In SWAT, volume 53 of LIPIcs, pages 22:1-22:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. Google Scholar
  6. Arindam Biswas, Varunkumar Jayapaul, and Venkatesh Raman. Improved bounds for poset sorting in the forbidden-comparison regime. In CALDAM, volume 10156 of Lecture Notes in Computer Science, pages 50-59. Springer, 2017. Google Scholar
  7. Phillip G Bradford. Matching nuts and bolts optimally. Technical report, Max-Planck-Institut für Informatik, 1995. Google Scholar
  8. Mark Braverman and Elchanan Mossel. Noisy sorting without resampling. In SODA, pages 268-276. SIAM, 2008. Google Scholar
  9. Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, and Amit Sahai. Query strategies for priced information. J. Comput. Syst. Sci., 64(4):785-819, 2002. Google Scholar
  10. Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, and Elad Verbin. Sorting and selection in posets. SIAM J. Comput., 40(3):597-622, 2011. Google Scholar
  11. Ulrich Faigle and György Turán. Sorting and recognition problems for ordered sets. SIAM J. Comput., 17(1):100-113, 1988. Google Scholar
  12. Uriel Feige, Prabhakar Raghavan, David Peleg, and Eli Upfal. Computing with noisy information. SIAM J. Comput., 23(5):1001-1018, 1994. Google Scholar
  13. Mayank Goswami and Riko Jacob. Sorting with priced comparisons: The general, the bichromatic, and the universal. CoRR, abs/2211.04601v2, 2023. A subset of results in this paper has been accepted to ITCS 2024, as [Mayank Goswami and Riko Jacob, 2024]. URL: https://arxiv.org/abs/2211.04601.
  14. Mayank Goswami and Riko Jacob. An algorithm for bichromatic sorting with polylog competitive ratio. In ITCS, 2024. See also https://arxiv.org/pdf/2311.05773.pdf. A prelimary version [Mayank Goswami and Riko Jacob, 2023] has appeared in arXiv.
  15. Yuzhou Gu and Yinzhan Xu. Optimal bounds for noisy sorting. In STOC. ACM, 2023. Google Scholar
  16. Anupam Gupta and Amit Kumar. Sorting and selection with structured costs. In FOCS, pages 416-425. IEEE Computer Society, 2001. Google Scholar
  17. Anupam Gupta and Amit Kumar. Where’s the winner? max-finding and sorting with metric costs. In APPROX-RANDOM, volume 3624 of Lecture Notes in Computer Science, pages 74-85. Springer, 2005. Google Scholar
  18. Zhiyi Huang, Sampath Kannan, and Sanjeev Khanna. Algorithms for the generalized sorting problem. In FOCS, pages 738-747. IEEE Computer Society, 2011. Google Scholar
  19. Shaofeng H. C. Jiang, Wenqian Wang, Yubo Zhang, and Yuhao Zhang. Algorithms for the generalized poset sorting problem, 2023. URL: https://arxiv.org/abs/2304.01623.
  20. Sampath Kannan and Sanjeev Khanna. Selection with monotone comparison cost. In SODA, pages 10-17. ACM/SIAM, 2003. Google Scholar
  21. János Komlós, Yuan Ma, and Endre Szemerédi. Matching nuts and bolts in o(n log n) time. SIAM J. Discret. Math., 11(3):347-372, 1998. Google Scholar
  22. William Kuszmaul and Shyam Narayanan. Stochastic and worst-case generalized sorting revisited. In FOCS, pages 1056-1067. IEEE, 2021. Google Scholar
  23. Pinyan Lu, Xuandi Ren, Enze Sun, and Yubo Zhang. Generalized sorting with predictions. In SOSA, pages 111-117. SIAM, 2021. Google Scholar
  24. Jishnu Roychoudhury and Jatin Yadav. Efficient algorithms for sorting in trees. CoRR, abs/2205.15912, 2022. URL: https://arxiv.org/abs/2205.15912.