Parametric monotone function maximization with matroid constraints
type: Item
instance of: scholarly article
title: Parametric monotone function maximization with matroid constraints
zbMATH Open document ID: 1432.90133
author: Suning Gong
author: Qingqin Nong
author: Wenjing Liu
author: Qizhi Fang
published in: Journal of Global Optimization
publication date: 2019-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7139384
zbMATH Keywords: increasing set function
zbMATH Keywords: matroid
zbMATH Keywords: generic submodularity ratio
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s10898-019-00800-2
OpenAlex ID: W2955556456
cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee
cites work: Q3503433
cites work: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
cites work: Submodular function maximization via the multilinear relaxation and contention resolution schemes
cites work: Matroids and the greedy algorithm
cites work: Q4414632
cites work: Welfare maximization and the supermodular degree
cites work: Constrained Monotone Function Maximization and the Supermodular Degree
cites work: Correlation inequalities on some partially ordered sets
cites work: Q4196269
cites work: Submodular functions and optimization.
cites work: Combinatorial auctions with decreasing marginal utilities
cites work: A framework of discrete DC programming by discrete convex analysis
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Maximizing monotone submodular functions over the integer lattice
cites work: Q3549686
cites work: An analysis of the greedy algorithm for the submodular set covering problem
cites work: Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
cites work: Set function optimization
DOI: 10.1007/S10898-019-00800-2
description: scientific article; zbMATH DE number 7139384