Sampling Multiple Edges Efficiently

DOI10.4230/LIPICS.APPROX/RANDOM.2021.51arXiv2008.08032OpenAlexW3203769804MaRDI QIDQ6070395

Talya Eden, Saleet Mossel, Ronitt Rubinfeld

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/abs/2008.08032

zbMATH Keywords

graph algorithmsublinear algorithmssampling edges

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs

This page was built for publication: Sampling Multiple Edges Efficiently