Maximizing bisubmodular and k-submodular functions

DOI10.1137/1.9781611973402.108MaRDI QIDQ5384070zbMATH OpenOpenAlexFDO

Authors Justin Ward, S. Zivny

Publication date 20 June 2019

Published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973402.108

Mathematics Subject Classification ID

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

Recommendations

• Maximizing k-submodular functions and beyond
• Improved approximation algorithms for \(k\)-submodular function maximization
• \(k\)-submodular maximization with two kinds of constraints
• Improved randomized algorithm for k-submodular function maximization
• Maximizing Non-monotone Submodular Functions

Cited in

(16)

• Derandomization for k-submodular maximization
• An exact cutting plane method for k-submodular function maximization
• Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
• Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences
• Towards minimizing k-submodular functions
• Improved approximation algorithms for \(k\)-submodular function maximization
• Maximizing k-submodular functions and beyond
• \(k\)-submodular maximization with two kinds of constraints
• Improved randomized algorithm for k-submodular function maximization
• Monotone diameter of bisubmodular polyhedra
• Weakly \(k\)-submodular maximization under matroid constraint
• Efficient algorithms for k-submodular function maximization with p-system and d-knapsack constraint
• On maximizing k-submodular functions under p-system and d-knapsack constraints
• Greedy algorithms for stochastic monotone k-submodular maximization under full-bandit feedback
• k-submodular maximization under individual knapsack constraints: applications and streaming algorithm
• Approximation algorithms for k-submodular maximization under fairness constraints and size constraints

This page was built for publication: Maximizing bisubmodular and \(k\)-submodular functions

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