Nearly optimal independence oracle algorithms for edge estimation in hypergraphs

Holger Dell, John Lapinskas, Kitty Meeks

Publikation: Working paperPreprint

Abstract

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.
OriginalsprogEngelsk
Antal sider92
DOI
StatusUdgivet - 7 nov. 2022

Fingeraftryk

Dyk ned i forskningsemnerne om 'Nearly optimal independence oracle algorithms for edge estimation in hypergraphs'. Sammen danner de et unikt fingeraftryk.

Citationsformater