A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
Approximation algorithms for NP-hard problems
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
SIAM Journal on Computing
An O(log*n) approximation algorithm for the asymmetric p-center problem
Journal of Algorithms
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - &egr;
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Integrality ratio for group Steiner trees and directed steiner trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Hardness of 3 - Uniform Hypergraph Coloring
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A new multilayered PCP and the hardness of hypergraph vertex cover
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Primal-dual algorithms for deterministic inventory problems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Asymmetry in k-center variants
Theoretical Computer Science - Approximation and online algorithms
Asymmetric k-center with minimum coverage
Information Processing Letters
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On LP-based approximability for strict CSPs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Discrete sensor placement problems in distribution networks
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
In the Asymmetric k-Center problem, the input is an integer k and a complete digraph over n points together with a distance function obeying the directed triangle inequality. The goal is to choose a set of k points to serve as centers and to assign all the points to the centers, so that the maximum distance of any point to its center is as small as possible. We show that the Asymmetric k-Center problem is hard to approximate up to a factor of log* n - Θ(1) unless NP ⊆ DTIME(nlog log n). Since an O(log* n)-approximation algorithm is known for this problem, this essentially resolves the approximability of this problem. This is the first natural problem whose approximability threshold does not polynomially relate to the known approximation classes. We also resolve the approximability threshold of the metric k-Center problem with costs.