Pages that link to "Item:Q2904748"
From MaRDI portal
The following pages link to A \(\frac{(k+3)}{2}\)-approximation algorithm for monotone submodular \(k\)-set packing and general \(k\)-exchange systems (Q2904748):
Displaying 10 items.
- On the intersection of independence systems (Q1785309) (← links)
- Generalized budgeted submodular set function maximization (Q2051778) (← links)
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096) (← links)
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- The multi-budget maximum weighted coverage problem (Q2692723) (← links)
- Practical budgeted submodular maximization (Q2701388) (← links)
- Generalized budgeted submodular set function maximization (Q5005131) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- Submodular Maximization Through the Lens of Linear Programming (Q5108239) (← links)
- Weak submodularity implies localizability: local search for constrained non-submodular function maximization (Q6646409) (← links)
