Open AccessDissertation
Algorithms for Some Clustering Problems
Ranjithkumar Rajagopalan
- 21 Jul 2005
About: The article was published on 21 Jul 2005. and is currently open access. The article focuses on the topics: Cluster analysis & Approximation algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
Generating samples under a Wright-Fisher neutral model of genetic variation.
TL;DR: A Monte Carlo computer program is available to generate samples drawn from a population evolving according to a Wright-Fisher neutral model, and the samples produced can be used to investigate the sampling properties of any sample statistic under these neutral models.
A General Approximation Technique for Constrained Forest Problems
TL;DR: The first approximation algorithms for many NP-complete problems, including the non-fixed point-to-point connection problem, the exact path partitioning problem and complex location-design problems are derived.
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation
Kamal Jain,Vijay V. Vazirani +1 more
TL;DR: A new extension of the primal-dual schema and the use of Lagrangian relaxation to derive approximation algorithms for the metric uncapacitated facility location problem and the metric k-median problem achieving guarantees of 3 and 6 respectively.
950
Probabilistic approximation of metric spaces and its algorithmic applications
Yair Bartal
- 14 Oct 1996
TL;DR: It is proved that any metric space can be probabilistically-approximated by hierarchically well-separated trees (HST) with a polylogarithmic distortion.
875
•Proceedings Article
A general approximation technique for constrained forest problems
Michel X. Goemans,David P. Williamson +1 more
- 01 Sep 1992
TL;DR: A 2-approximation algorithm for the Steiner tree problem was given in this paper with running time of O(n 2 log n) for the shortest path problem, where n is the number of vertices in a graph.