Online BP functions maximization

DOI10.1007/978-3-030-57602-8_16zbMath1482.68278OpenAlexW3048340507MaRDI QIDQ2039657

Ling Chen, Xiaoyan Zhang, Hong Chang, Zhi-cheng Liu, Dong-lei Du

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_16

zbMATH Keywords

approximation algorithmcompetitive ratiopartition matroidonline BP maximizationsubmodular termsupermodular term

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Online algorithms for BP functions maximization

Cites Work

• Unnamed Item
• Unnamed Item
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Approximating the least core value and least core of cooperative games with supermodular costs
• Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization
• Submodular Max-SAT
• Online Submodular Maximization with Preemption

This page was built for publication: Online BP functions maximization