Pages that link to "Item:Q2843232"
From MaRDI portal
The following pages link to Efficient Submodular Function Maximization under Linear Packing Constraints (Q2843232):
Displaying 7 items.
- Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← links)
- Algorithms for influence maximization in socio-physical networks (Q2095554) (← links)
- (Q5091209) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
- Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710) (← links)
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint (Q5925506) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6140348) (← links)