Derandomization for \(k\)-submodular maximization

DOI10.1007/978-3-319-78825-8_8zbMath1504.68284arXiv1610.07729OpenAlexW2545520746MaRDI QIDQ1642687

Hiroki Oshima

Publication date: 15 June 2018

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

Mathematics Subject Classification ID

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

Related Items (3)

Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms ⋮ Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint ⋮ k-Submodular maximization with two kinds of constraints

This page was built for publication: Derandomization for \(k\)-submodular maximization