On maximizing a monotone k-submodular function subject to a matroid constraint

A k-submodular function is an extension of a submodular function in that its input is given by k disjoint subsets instead of a single subset. For unconstrained nonnegative k-submodular maximization, Ward and Živný proposed a constant-factor approximation algorithm, which was improved by the recent w...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete optimization Ročník 23; s. 105 - 113
Hlavný autor:	Sakaue, Shinsaku
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.02.2017
Predmet:	[formula omitted]-submodular function Greedy algorithm Matroid constraint Greedy algorithm k-submodular function Matroid constraint
ISSN:	1572-5286, 1873-636X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!