Fast parallel algorithms for submodular \(p\)-superseparable maximization

DOI10.1007/978-3-031-49815-2_16MaRDI QIDQ6574951

Anthony Wirth, Junhao Gan, Philip Cervenjak

Publication date: 19 July 2024

zbMATH Keywords

parallel algorithmsapproximation algorithmssubmodular maximization

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational experience with approximation algorithms for the set covering problem
• FPT approximation schemes for maximizing submodular functions
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• A polynomial lower bound on adaptive complexity of submodular maximization
• An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model
• The adaptive complexity of maximizing a submodular function
• Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity
• Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
• An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
• Submodular Function Maximization in Parallel via the Multilinear Relaxation

This page was built for publication: Fast parallel algorithms for submodular \(p\)-superseparable maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574951)