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):
Displaying 28 items.
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438) (← links)
- On the approximation of the minimum disturbance \(p\)-facility location problem (Q1348254) (← links)
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem (Q1604042) (← links)
- Greedy algorithms for the single-demand facility location problem (Q1728306) (← links)
- An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
- Uniform capacitated facility location problem with random input data (Q1948657) (← 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)
- Private non-monotone submodular maximization (Q2091093) (← 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)
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem (Q2271817) (← 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)
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice (Q2677650) (← links)
- Profit maximization in social networks and non-monotone DR-submodular maximization (Q2700789) (← links)
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem (Q3012910) (← links)
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem (Q3411298) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- Greedy Strikes Back: Improved Facility Location Algorithms (Q4240134) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem (Q5901421) (← links)
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations (Q6095506) (← links)
- A binary search double greedy algorithm for non-monotone DR-submodular maximization (Q6167000) (← links)
- Adaptive algorithms on maximizing monotone nonsubmodular functions (Q6566785) (← links)
