ESA
2000
Springer
14 years 3 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
ESA
2000
Springer
14 years 3 months ago
2000
Springer
ESA
2000
Springer
14 years 3 months ago
2000
Springer
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...