On the ball spanned by balls
Copyright policy )On the ball spanned by balls
The author presents a linear-time algorithm for a class of problems including the multiplicative weighted-center problem, that is, there are some demand points and one seeks a facility location to minimize the largest weighted distance between the facility and any demand point. The main example is the problem of finding the smallest ball enclosing n given balls.
- DigiZeitschriften Germany
- Tel Aviv University Israel
- IBM (United States) United States
- IBM Research - Almaden United States
multiplicative weighted-center problem, facility location, Analysis of algorithms and problem complexity, Inventory, storage, reservoirs, Quadratic programming, Article, 510.mathematics, Nonlinear programming, linear-time algorithm
multiplicative weighted-center problem, facility location, Analysis of algorithms and problem complexity, Inventory, storage, reservoirs, Quadratic programming, Article, 510.mathematics, Nonlinear programming, linear-time algorithm
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).30 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!