scientific article; zbMATH DE number 1559542
From MaRDI portal
Publication:4526991
zbMath0962.68008MaRDI QIDQ4526991
Éva Tardos, Karen Aardal, David B. Shmoys
Publication date: 28 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties, Combinatorial approximation algorithms for the robust facility location problem with penalties, Beyond Moulin mechanisms, Complexity of single-swap heuristics for metric facility location and related problems, An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution, Clustering to minimize the sum of cluster diameters, New approximation algorithms for the unsplittable capacitated facility location problem, Integrality gaps for strengthened linear relaxations of capacitated facility location, On the bounded-hop MST problem on random Euclidean instances, Finding a collective set of items: from proportional multirepresentation to group recommendation, A hybrid multistart heuristic for the uncapacitated facility location problem, Approximation algorithms for facility location problems with a special class of subadditive cost functions, Approximation algorithm for uniform bounded facility location problem, A cross-monotonic cost-sharing scheme for the concave facility location game, A branch-and-price algorithm for the capacitated facility location problem, Approximating activation edge-cover and facility location problems, A review of hierarchical facility location models, LP-based approximation for uniform capacitated facility location problem, Incremental facility location problem and its competitive algorithms, An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties, An approximation algorithm for the \(k\)-level stochastic facility location problem, An approximation algorithm for the \(k\)-level capacitated facility location problem, Minimizing energies with hierarchical costs, An approximation algorithm for the dynamic facility location problem with submodular penalties, An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities, An approximation algorithm for the \(k\)-level concentrator location problem, Fast approximate energy minimization with label costs, Centrality of trees for capacitated \(k\)-center, Recovery guarantees for exemplar-based clustering, Approximation algorithms for the fault-tolerant facility placement problem, Maximum gradient embeddings and monotone clustering, Approximation algorithms for the priority facility location problem with penalties, A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem, An approximation algorithm for soft capacitated \(k\)-facility location problem, Optimizing server placement in distributed systems in the presence of competition, Improved approximation algorithms for the robust fault-tolerant facility location problem, A primal-dual approximation algorithm for stochastic facility location problem with service installation costs, A primal-dual algorithm for online non-uniform facility location, Approximation algorithm for facility location with service installation costs, Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach, LP-based approximation algorithms for capacitated facility location, LP-based approximation algorithms for facility location in buy-at-bulk network design, LP-rounding algorithms for the fault-tolerant facility placement problem, Micro-review synthesis for multi-entity summarization, Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties, Observations on some heuristic methods for the capacitated facility location problem, A hybrid firefly-genetic algorithm for the capacitated facility location problem, Approximation algorithms for the robust facility leasing problem, Towards flexible demands in online leasing problems, Multi-level facility location problems, Robust fault tolerant uncapacitated facility location, Mobile facility location: combinatorial filtering via weighted occupancy, A distributed O(1)-approximation algorithm for the uniform facility location problem, Fault-tolerant concave facility location problem with uniform requirements, Capacitated domination problem, A new approximation algorithm for the multilevel facility location problem, Kinetic facility location, The vendor location problem, A simple and deterministic competitive algorithm for online facility location, A simple tabu search for warehouse location, Randomized priority algorithms, Facility location models for distribution system design, Improved approximation algorithms for capacitated facility location problems, Soft-capacitated facility location game, A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties, An improved per-scenario bound for the two-stage stochastic facility location problem, Approximation algorithms for the lower-bounded \(k\)-median and its generalizations, Near-optimal solutions to large-scale facility location problems, Local search approximation algorithms for the sum of squares facility location problems, Approximating the \(\tau\)-relaxed soft capacitated facility location problem, Facility location problems: a parameterized view, Facility location with red-blue demands, 2-level station location for bike sharing, Approximation algorithms for the lower-bounded knapsack median problem, LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem, An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties, An approximation algorithm for the \(k\)-level facility location problem with outliers, An approximation algorithm for the stochastic fault-tolerant facility location problem, Improved approximation algorithms for the facility location problems with linear/submodular penalties, A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems, Approximation algorithms for connected facility location problems, On the power of static assignment policies for robust facility location problems, Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems, An improved approximation algorithm for uncapacitated facility location problem with penalties, A 6.55 factor primal-dual approximation algorithm for the connected facility location problem, An LP rounding algorithm for approximating uncapacitated facility location problem with penalties, An approximation algorithm for stochastic multi-level facility location problem with soft capacities, A cross-monotonic cost sharing method for the facility location game with service installation costs, Bounding quality of pure Nash equilibria in dual-role facility location games, Generalized submodular cover problems and applications, The General Steiner Tree-Star problem., Capacitated domination: problem complexity and approximation algorithms, Improved approximation algorithms for constrained fault-tolerant resource allocation, Improved approximation algorithms for solving the squared metric \(k\)-facility location problem, An approximation algorithm for the maximization version of the two level uncapacitated facility location problem, A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem, Improved approximation algorithms for multilevel facility location problems, Submodularity and local search approaches for maximum capture problems under generalized extreme value models, A constant-factor approximation algorithm for the \(k\)-median problem, Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties), Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems, From Cost Sharing Mechanisms to Online Selection Problems, LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design, Approximation algorithms for hard capacitated \(k\)-facility location problems, Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties, Improved Approximation Algorithm for Fault-Tolerant Facility Placement, The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem, Analysis of a local search algorithm for the k-facility location problem, A PTAS for the geometric connected facility location problem, Approximation algorithms for \(k\)-level stochastic facility location problems, An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem, Approximation Algorithms for the Robust Facility Location Problem with Penalties, Approximation algorithms for the individually fair \(k\)-center with outliers, Robust network function virtualization, An approximation algorithm for the dynamic facility location problem with outliers, Approximation algorithms for the fault-tolerant facility location problem with penalties, Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center, Approximation algorithms for the fault-tolerant facility location problem with submodular penalties, The facility location problem with maximum distance constraint, An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions, Approximation algorithm for squared metric two-stage stochastic facility location problem, Facility Location Problems: A Parameterized View, Unnamed Item, Unnamed Item, Capacitated facility location with outliers/penalties, A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties, Approximation Algorithms for Stochastic and Risk-Averse Optimization, A primal-dual approximation algorithm for the facility location problem with submodular penalties, Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms, LP-Based Algorithms for Capacitated Facility Location, Unnamed Item, Respecting lower bounds in uniform lower and upper bounded facility location problem, Approximate the lower-bounded connected facility location problem, Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems, On the Location and p-Median Polytopes, A PTAS for the cardinality constrained covering with unit balls, Unnamed Item, An approximation algorithm for the \(k\)-median warehouse-retailer network design problem, Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location, Unnamed Item, Capacitated Domination Problem, A \(k\)-product uncapacitated facility location problem, Multi-period capacitated location with modular equipments, Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics, Approximation Algorithm for the Uniform Bounded Facility Problem, Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties, The \(k\)-level facility location game, Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems, Operations research and data mining, The approximation gap for the metric facility location problem is not yet closed, A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem, On the competitive ratio for online facility location, Supply Chain Management with Online Customer Selection, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Hedging uncertainty: approximation algorithms for stochastic optimization problems, Approximating the two-level facility location problem via a quasi-greedy approach, An approximation algorithm for a facility location problem with stochastic demands and inventories, A General k-Level Uncapacitated Facility Location Problem, Incremental algorithms for facility location and \(k\)-median, Integrating facility location and production planning decisions, Unnamed Item, A local search approximation algorithm for a squared metric \(k\)-facility location problem, Online facility assignment, Mixed fault tolerance in server assignment: combining reinforcement and backup, Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems, Approximating $k$-Median via Pseudo-Approximation, The Priority k-Median Problem, Unnamed Item, Approximation algorithms for hierarchical location problems, Constant factor approximation algorithm for uniform hard capacitated knapsack median problem, Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem, Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks, Unnamed Item, Unnamed Item
