A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms
Complexity of Partial Satisfaction
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Powers of graphs: A powerful approximation technique for bottleneck problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Finding a hamiltonian cycle in the square of a block
Finding a hamiltonian cycle in the square of a block
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Static and dynamic information organization with star clusters
Proceedings of the seventh international conference on Information and knowledge management
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
A practical clustering algorithm for static and dynamic information organization
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Point set labeling with specified positions
Proceedings of the sixteenth annual symposium on Computational geometry
Sublinear time approximate clustering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Approximation algorithms for clustering to minimize the sum of diameters
Nordic Journal of Computing
Approximation algorithms for the bottleneck stretch factor problem
Nordic Journal of Computing
Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for Clustering to Minimize the Sum of Diameters
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Fast Multi-scale Method for Drawing Large Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Approximation Algorithms for Hamming Clustering Problems
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Asymmetric k-center is log* n-hard to approximate
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Machine Learning
A New Conceptual Clustering Framework
Machine Learning
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Asymmetric k-center is log* n-hard to approximate
Journal of the ACM (JACM)
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
Correlation clustering in general weighted graphs
Theoretical Computer Science - Approximation and online algorithms
Asymmetry in k-center variants
Theoretical Computer Science - Approximation and online algorithms
k-Center problems with minimum coverage
Theoretical Computer Science
An improved algorithm for the p-center problem on interval graphs with unit lengths
Computers and Operations Research
Software controlled memory layout reorganization for irregular array access patterns
CASES '07 Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems
Asymmetric k-center with minimum coverage
Information Processing Letters
On the Approximation of Correlation Clustering and Consensus Clustering
Journal of Computer and System Sciences
Packing and Covering δ-Hyperbolic Spaces by Balls
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
A linear-space algorithm for distance preserving graph embedding
Computational Geometry: Theory and Applications
On hierarchical traffic grooming in WDM networks
IEEE/ACM Transactions on Networking (TON)
Tight results for clustering and summarizing data streams
Proceedings of the 12th International Conference on Database Theory
A generalized minimum cost k-clustering
ACM Transactions on Algorithms (TALG)
Private approximation of clustering and vertex cover
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Approximation algorithms for bounded facility location
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Joint base station and relay station placement for IEEE 802.16j networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Clustering lines in high-dimensional space: Classification of incomplete data
ACM Transactions on Algorithms (TALG)
Modeling and estimating the spatial distribution of healthcare workers
Proceedings of the 1st ACM International Health Informatics Symposium
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
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
Computational Geometry: Theory and Applications
Minimum data-latency-bound k-sink placement problem in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Improved approximability and non-approximability results for graph diameter decreasing problems
Theoretical Computer Science
The connected p-center problem on block graphs with forbidden vertices
Theoretical Computer Science
Computer Science Review
One-way and round-trip center location problems
Discrete Optimization
Experimental analysis of heuristics for the bottleneck traveling salesman problem
Journal of Heuristics
The fault tolerant capacitated k-center problem
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Matroid and knapsack center problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
The euclidean k-supplier problem
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis
Computers and Operations Research
| Hi-index | 0.01 |
In this paper a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design is investigated. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition, for several of these problems we can show that unless P = NP, there does not exist a polynomial-time algorithm that has a better performance guarantee.