An 0. 828-approximation algorithm for the uncapacitated facility location problem
From MaRDI portal
Recommendations
Cites work
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- scientific article; zbMATH DE number 4202014 (Why is no real title available?)
- scientific article; zbMATH DE number 3559283 (Why is no real title available?)
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
Cited in
(46)- On the approximation of the minimum disturbance \(p\)-facility location problem
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
- Greedy algorithms for the single-demand facility location problem
- An approximation algorithm for a competitive facility location problem with network effects
- Uniform capacitated facility location problem with random input data
- Donation center location problem
- PASS approximation: a framework for analyzing and designing heuristics
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- Private non-monotone submodular maximization
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
- Approximating the two-level facility location problem via a quasi-greedy approach
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice
- Profit maximization in social networks and non-monotone DR-submodular maximization
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- scientific article; zbMATH DE number 4202014 (Why is no real title available?)
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- Greedy Strikes Back: Improved Facility Location Algorithms
- scientific article; zbMATH DE number 1303608 (Why is no real title available?)
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- scientific article; zbMATH DE number 1560330 (Why is no real title available?)
- scientific article; zbMATH DE number 1833407 (Why is no real title available?)
- Online submodular maximization with preemption
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- Constrained submodular maximization via a nonsymmetric technique
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
- A binary search double greedy algorithm for non-monotone DR-submodular maximization
- Adaptive algorithms on maximizing monotone nonsubmodular functions
- Monotonic decompositions of submodular set functions
- Monotone submodular maximization under the pairwise capacity constraint
- Approximation algorithms for two extensions of min-k-union
- Recoverable robust cardinality constrained maximization with commitment of a submodular function
- Group equality and equity in submodular maximization
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- A fast algorithm for submodular maximization with a matroid constraint
- Revisiting non-monotone regularized submodular maximization: bi-criteria and pass approximations
- Efficient deterministic algorithms for maximizing symmetric submodular functions
- An exact solver for submodular knapsack problems
- Modified greedy algorithm for monotone submodular maximization with knapsack and partition matroid constraints
- Recoverable robust cardinality constrained maximization with commitment of a submodular function
- Deterministic algorithms for k-submodular maximization with the chance constraint
This page was built for publication: An 0. 828-approximation algorithm for the uncapacitated facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296569)
