Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546): Difference between revisions

Latest revision as of 11:37, 29 July 2024

scientific article

Language	Label	Description	Also known as
English	Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --	scientific article

Statements

instance of

scholarly article

0 references

title

Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (English)

0 references

0 references

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

29 June 2022

0 references

full work available at URL

https://arxiv.org/abs/1907.04279

0 references

zbMATH Keywords

submodular maximization

0 references

continuous greedy

0 references

distributive lattices

0 references

median complex

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Pipage rounding: a new method of constructing algorithms with proven performance guarantee

0 references

Q3514516

0 references

Matroids on partially ordered sets

0 references

Braids, posets and orthoschemes

0 references

Q4720067

0 references

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

0 references

Weakly Modular Graphs and Nonpositive Curvature

0 references

Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes

0 references

Graphs of some CAT(0) complexes

0 references

Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem

0 references

Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

0 references

A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES

0 references

Probability Inequalities Related to Markov's Theorem

0 references

Submodular Function Maximization on the Bounded Integer Lattice

0 references

Q3875978

0 references

L-CONVEXITY ON GRAPH STRUCTURES

0 references

Probability Inequalities for Sums of Bounded Random Variables

0 references

Q4633865

0 references

Rank axiom of modular supermatroids: a connection with directional DR submodular functions

0 references

An analysis of approximations for maximizing submodular set functions—I

0 references

Maximizing monotone submodular functions over the integer lattice

0 references

A note on maximizing a submodular set function subject to a knapsack constraint

0 references

Minimizing a Submodular Function on a Lattice

0 references

Q3549686

0 references

Identifiers

zbMATH Open document ID

1494.90098

0 references

DOI

10.1007/s10107-021-01620-7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2149546

@@ Property / cites work @@
+Pipage rounding: a new method of constructing algorithms with proven performance guarantee
+Normal rank
@@ Property / cites work @@
+Q3514516
@@ Property / cites work: Q3514516 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroids on partially ordered sets
@@ Property / cites work: Matroids on partially ordered sets / rank @@
+Normal rank
@@ Property / cites work @@
+Braids, posets and orthoschemes
@@ Property / cites work: Braids, posets and orthoschemes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4720067
@@ Property / cites work: Q4720067 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
+Normal rank
@@ Property / cites work @@
+Weakly Modular Graphs and Nonpositive                     Curvature
@@ Property / cites work: Weakly Modular Graphs and Nonpositive Curvature / rank @@
+Normal rank
@@ Property / cites work @@
+Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
+Normal rank
@@ Property / cites work @@
+Graphs of some CAT(0) complexes
@@ Property / cites work: Graphs of some CAT(0) complexes / rank @@
+Normal rank
@@ Property / cites work @@
+Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
+Normal rank
@@ Property / cites work @@
+Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
+Normal rank
@@ Property / cites work @@
+A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
+Normal rank
@@ Property / cites work @@
+Probability Inequalities Related to Markov's Theorem
+Normal rank
@@ Property / cites work @@
+Submodular Function Maximization on the Bounded Integer Lattice
+Normal rank
@@ Property / cites work @@
+Q3875978
@@ Property / cites work: Q3875978 / rank @@
+Normal rank
@@ Property / cites work @@
+L-CONVEXITY ON GRAPH STRUCTURES
@@ Property / cites work: L-CONVEXITY ON GRAPH STRUCTURES / rank @@
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+Q4633865
@@ Property / cites work: Q4633865 / rank @@
+Normal rank
@@ Property / cites work @@
+Rank axiom of modular supermatroids: a connection with directional DR submodular functions
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Maximizing monotone submodular functions over the integer lattice
+Normal rank
@@ Property / cites work @@
+A note on maximizing a submodular set function subject to a knapsack constraint
+Normal rank
@@ Property / cites work @@
+Minimizing a Submodular Function on a Lattice
@@ Property / cites work: Minimizing a Submodular Function on a Lattice / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549686
@@ Property / cites work: Q3549686 / rank @@
+Normal rank