scientific article; zbMATH DE number 1445291
From MaRDI portal
zbMATH Open0952.90023MaRDI QIDQ4952604FDOQ4952604
Authors: Neal E. Young 
Publication date: 15 January 2001
Title of this publication is not available (Why is that?)
Recommendations
- Approximation algorithms for bounded facility location problems
- scientific article; zbMATH DE number 1559542
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- scientific article; zbMATH DE number 1670526
- Local Search Heuristics for k-Median and Facility Location Problems
Cited In (14)
- Incremental medians via online bidding
- Facility location problems: a parameterized view
- Title not available (Why is that?)
- An improved approximation algorithm for vertex cover with hard capacities
- Optimality of the coordinate-wise median mechanism for strategyproof facility location in two dimensions
- An approximation algorithm for the \(k\)-median warehouse-retailer network design problem
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- Facility Location Problems: A Parameterized View
- Title not available (Why is that?)
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs
- General asymptotic and submodular results for the Median problem with unreliable facilities
- Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint
- Mobile facility location: combinatorial filtering via weighted occupancy
- Better guarantees for \(k\)-median with service installation costs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952604)
