On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints

A k -submodular function is a generalization of a submodular function. The definition domain of a k -submodular function is a collection of k -disjoint subsets instead of simple subsets of ground set. In this paper, we consider the maximization of a k -submodular function with the intersection of a...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 45; no. 3; p. 93
Main Authors:	Yu, Kemin, Li, Min, Zhou, Yang, Liu, Qian
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2023 Springer Nature B.V
Subjects:	Algorithms Approximation Combinatorics Constraints Convex and Discrete Geometry Greedy algorithms Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Maximization Operations Research/Decision Theory Optimization S.I. : AAIM 2022 Search algorithms Theory of Computation 68W40 Matroid constraint Submodularity 90C27 68W25 Approximation algorithm Knapsack constraint
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!