Generalized p-center problems: Complexity results and approximation algorithms
From MaRDI portal
Generalized \(p\)-center problems: Complexity results and approximation algorithms
Recommendations
- The complexity of generalized center problem
- Un nuevo resultado sobre la complejidad del problema delP-centro
- Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
- Approximability results for the converse connected \(p\)-centre problem
- Approximation algorithms for diversity-bounded center problems
- The p-Centre Problem-Heuristic and Optimal Algorithms
- The generalized discrete ‐centroid problem
- The approximability of the \(p\)-hub center problem with parameterized triangle inequality
- scientific article; zbMATH DE number 849074
- On the complexity of the \((r|p)\)-centroid problem in the plane
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Clustering to minimize the maximum intercluster distance
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Network flows. Theory, algorithms, and applications.
- On alternativep-center problems
- On the Complexity of Timetable and Multicommodity Flow Problems
- The slab dividing approach to solve the Euclidean \(P\)-center problem
Cited in
(23)- A Polynomial Time Approximation Scheme for the Closest Shared Center Problem
- scientific article; zbMATH DE number 7278055 (Why is no real title available?)
- Low rank approximation of binary matrices: column subset selection and generalizations
- Approximation schemes for the generalized extensible bin packing problem
- A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff
- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
- Minimum-diameter covering problems
- Approximability results for the $p$-centdian and the converse centdian problems
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- Covering moving points with anchored disks
- On alternativep-center problems
- A relaxation-based algorithm for solving the conditional \(p\)-center problem
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- scientific article; zbMATH DE number 871893 (Why is no real title available?)
- Insertion heuristics for central cycle problems
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality
- Approximability results for the converse connected \(p\)-centre problem
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier
- On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
- On the Complexity of Some Common Geometric Location Problems
- Un nuevo resultado sobre la complejidad del problema delP-centro
- The \(p\)-neighbor \(k\)-center problem
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
This page was built for publication: Generalized \(p\)-center problems: Complexity results and approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278142)
