scientific article; zbMATH DE number 871893
From MaRDI portal
Publication:4875162
Recommendations
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- scientific article; zbMATH DE number 1757943
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
- Asymmetric k -center is log * n -hard to approximate
- Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
- Generalized \(p\)-center problems: Complexity results and approximation algorithms
- scientific article; zbMATH DE number 1285629
- Un nuevo resultado sobre la complejidad del problema delP-centro
- A scalable exact algorithm for the vertex \(p\)-center problem
- Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
Cited in
(10)- Asymmetry in \(k\)-center variants
- Asymmetric \(k\)-center with minimum coverage
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- Approximation algorithms for Hamming clustering problems
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
- Constant-factor greedy algorithms for the asymmetric \(p\)-center problem in parameterized complete digraphs
- scientific article; zbMATH DE number 1757943 (Why is no real title available?)
- Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier
- Facility location with dynamic distance functions
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 Q4875162)
