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...

Full description

Bibliographic Details

Published in:	Discrete optimization Vol. 23; pp. 105 - 113
Main Author:	Sakaue, Shinsaku
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2017
Subjects:	[formula omitted]-submodular function Greedy algorithm Matroid constraint Greedy algorithm k-submodular function Matroid constraint
ISSN:	1572-5286, 1873-636X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!