Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice Continuous Greedy Algorithm on Median Complex

We consider a problem of maximizing a monotone DR-submodular function under multiple order-consistent knapsack constraints on a distributive lattice. Because a distributive lattice is used to represent a dependency constraint, the problem can represent a dependency constrained version of a submodula...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming Ročník 194; číslo 1-2; s. 85 - 119
Hlavní autori:	Maehara, Takanori, Nakashima, So, Yamaguchi, Yutaro
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2022
Predmet:	Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical 90C27 (Mathematical programming; Combinatorial Optimization) Distributive lattices Continuous greedy Median complex Submodular maximization 68W25 (Algorithms in computer science; Approximation Algorithm) 06D99 (Distributive lattices; None of the above, but in this section)
ISSN:	0025-5610, 1436-4646
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!