Online BP functions maximization

DOI10.1007/978-3-030-57602-8_16MaRDI QIDQ2039657zbMATH OpenOpenAlexFDO

Authors Ling Chen, Hong Chang, Xiaoyan Zhang, Zhicheng Liu, Donglei 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 ratioonline BP maximizationpartition matroidsubmodular termsupermodular term

Mathematics Subject Classification ID

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

Recommendations

• Online algorithms for BP functions maximization
• Online one-sided smooth function maximization
• A continuous-time approach to online optimization
• Online Convex Optimization With Binary Constraints
• Online constrained optimization with recourse
• Global convergence of online limited memory BFGS
• Online optimization for max-norm regularization
• On-Line Difference Maximization
• Online learning and online convex optimization
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making

Cites work

• Approximating the least core value and least core of cooperative games with supermodular costs
• Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
• Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
• Online submodular maximization with preemption
• Revenue submodularity
• Submodular Max-SAT
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem

Cited in

(2)

• Online algorithms for BP functions maximization
• Two-stage BP maximization under p-matroid constraint

This page was built for publication: Online BP functions maximization

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