Parametric monotone function maximization with matroid constraints
From MaRDI portal
Publication:2010096
DOI10.1007/S10898-019-00800-2zbMATH Open1432.90133OpenAlexW2955556456MaRDI QIDQ2010096FDOQ2010096
Authors: Suning Gong, Qingqin Nong, Wenjing Liu, Qizhi Fang 
Publication date: 3 December 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00800-2
Recommendations
- Fast algorithms for maximizing monotone nonsubmodular functions
- Fast algorithms for maximizing monotone nonsubmodular functions
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- An analysis of the greedy algorithm for the submodular set covering problem
- Submodular functions and optimization.
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Correlation inequalities on some partially ordered sets
- Combinatorial auctions with decreasing marginal utilities
- An analysis of approximations for maximizing submodular set functions—I
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Matroids and the greedy algorithm
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Optimal approximation for the submodular welfare problem in the value oracle model
- Title not available (Why is that?)
- A framework of discrete DC programming by discrete convex analysis
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Set function optimization
- Constrained Monotone Function Maximization and the Supermodular Degree
- Welfare maximization and the supermodular degree
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- Maximizing monotone submodular functions over the integer lattice
Cited In (25)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- Greedy is good: constrained non-submodular function maximization via weak submodularity
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions
- A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions
- Matroid optimization problems with monotone monomials in the objective
- Non-Submodular Maximization with Matroid and Knapsack Constraints
- Bicriteria algorithms to balance coverage and cost in team formation under online model
- Online bicriteria algorithms to balance coverage and cost in team formation
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint
- Improved algorithms for non-submodular function maximization problem
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint
- Maximization problems of balancing submodular relevance and supermodular diversity
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice
- Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint
- Fast algorithms for maximizing monotone nonsubmodular functions
- Fast algorithms for maximizing monotone nonsubmodular functions
- Streaming algorithms for non-submodular functions maximization with \(d\)-knapsack constraint on the Integer lattice
- Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
- Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
- The submodularity of two-stage stochastic maximum-weight independent set problems
- On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint
This page was built for publication: Parametric monotone function maximization with matroid constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010096)
