Asset Details
Do you wish to reserve the book?
A 16-competitive algorithm for hierarchical median problem
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?
A 16-competitive algorithm for hierarchical median problem
Do you wish to request the book?
A 16-competitive algorithm for hierarchical median problem
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
A 16-competitive algorithm for hierarchical median problem
2014
Overview
The hierarchical median problem consists of finding a hierarchical assignment function sequence of solutions to the well-known k-median problems with growing cardinality. This sequence is said to be r competitive if the cost of each solution is at most r times of the optimum cost of median problem with a same cardinality, where r is called the competitive ratio. Previously the best algorithm available for this problem has competitive ratio 20.71. In this paper an improved aigorithm is proposed with competitive ratio factor 16.
We currently cannot retrieve any items related to this title. Kindly check back at a later time.