Pages that link to "Item:Q1296569"
From MaRDI portal
The following pages link to An 0. 828-approximation algorithm for the uncapacitated facility location problem (Q1296569):
Displayed 13 items.
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
- Donation center location problem (Q1949758) (← links)
- PASS approximation: a framework for analyzing and designing heuristics (Q1950388) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293) (← links)
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms (Q2321329) (← links)
- Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- (Q5091245) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)