An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon

References

• Aronov B, Carmi P, Katz MJ (2009) Minimum-cost load-balancing partitions. Algorithmica 54(3):318–336.Crossref, Google Scholar
• Arora S, Raghavan P, Rao S (1998) Approximation schemes for Euclidean k-medians and related problems. Vitter J, ed. Proc. Thirtieth Annual ACM Sympos. Theory Comput. STOC '98 (ACM, New York), 106–113.Crossref, Google Scholar
• Brimberg J, Hansen P, Mlandinović N, Taillard ED (2000) Improvement and comparison of heuristics for solving the uncapacitated multisource Weber problem. Oper. Res. 48(3):444–460.Link, Google Scholar
• Charikar M, Guha S, Tardos É, Shmoys DB (2002) A constant-factor approximation algorithm for the k-median problem. J. Comput. Syst. Sci. 65(1):129–149.Crossref, Google Scholar
• Fekete SP, Mitchell JSB, Beurer K (2005) On the continuous Fermat-Weber problem. Oper. Res. 53(1):61–76.Link, Google Scholar
• Lyness JN, Cools R (1994) A survey of numerical cubature over triangles. Gautschi W, ed. Proc. Symposia Appl. Math. (American Mathematical Society, Providence, RI), 127–150.Crossref, Google Scholar
• Mitchell JSB (1999) Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. 28(4):1298–1309.Crossref, Google Scholar
• Papadimitriou CH (1981) Worst-case and probabilistic analysis of a geometric location problem. SIAM J. Comput. 10(3):542–557.Crossref, Google Scholar
• Preparata FP, Shamos MI (1985) Computational Geometry: An Introduction (Springer-Verlag, New York).Crossref, Google Scholar
• Toussaint G (1983) Solving geometric problems with the rotating calipers. Protonotarios EN, ed. Proc. IEEE Melecon, Vol. 9 (IEEE, New York), 1–8.Google Scholar