You might also read
Articles linked to this work by shared authors, journal, and citation graph.
This study introduces an efficient algorithm for the multidimensional weighted minimax location problem, minimizing maximal weighted distances. The method provides an epsilon-approximate solution with a time complexity of O(n log epsilon) for fixed dimensions.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: