Nearly optimal independence oracle algorithms for edge estimation in hypergraphs

Autor:	Dell, Holger, Lapinskas, John, Meeks, Kitty
Rok vydání:	2022
Předmět:	Computer Science - Computational Complexity Computer Science - Data Structures and Algorithms
Druh dokumentu:	Working Paper
Popis:	We study a query model of computation in which an n-vertex k-hypergraph can be accessed only via its independence oracle or via its colourful independence oracle, and each oracle query may incur a cost depending on the size of the query. In each of these models, we obtain oracle algorithms to approximately count the hypergraph's edges, and we unconditionally prove that no oracle algorithm for this problem can have significantly smaller worst-case oracle cost than our algorithms.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2211.03874 Zobrazit plný text záznamu View this record from Arxiv