Asset Details
Do you wish to reserve the book?
New Approximation Algorithms for Weighted Maximin Dispersion Problem with Box or Ball Constraints
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
New Approximation Algorithms for Weighted Maximin Dispersion Problem with Box or Ball Constraints
Do you wish to request the book?
New Approximation Algorithms for Weighted Maximin Dispersion Problem with Box or Ball Constraints
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
New Approximation Algorithms for Weighted Maximin Dispersion Problem with Box or Ball Constraints
2021
Overview
In this paper, we propose new approximation algorithms for a NP-hard problem, i.e., weighted maximin dispersion problem. By using a uniformly distributed random sample method, we first propose a new random approximation algorithm for box constrained or ball constrained weighted maximin dispersion problems and analyze its approximation bound respectively. Moreover, we propose two improved approximation algorithms by combining our technique with an existing binary sample technique for both cases. To the best of our knowledge, they are the best approximation bounds for both box constrained and ball constrained weighted maximin dispersion problems respectively.
Publisher
Springer Nature B.V
Subject
