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
Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - \epsilon
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Primal-Dual Algorithms for Deterministic Inventory Problems
Mathematics of Operations Research
Tight results for clustering and summarizing data streams
Proceedings of the 12th International Conference on Database Theory
Approximability of packing disjoint cycles
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Resource minimization for fire containment
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for the bottleneck asymmetric traveling salesman problem
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM Journal on Computing
Linear-work greedy parallel approximate set cover and variants
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
The connected p-center problem on block graphs with forbidden vertices
Theoretical Computer Science
Matroid and knapsack center problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Hi-index | 0.04 |
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 from 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−O(1) unless NP ⊆ DTIME(nlog log n). Since an O(log*n)-approximation algorithm is known for this problem, this resolves the asymptotic approximability of ASYMMETRIC k-CENTER. 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 (symmetric) k-Center problem with costs.