A simpler and better derandomization of an approximation algorithm for single source rent-or-buy

A simpler and better derandomization of an approximation algorithm for single source rent-or-buy

0.00 Avg rating0 Votes
Article ID: iaor20084075
Country: Netherlands
Volume: 35
Issue: 6
Start Page Number: 707
End Page Number: 712
Publication Date: Nov 2007
Journal: Operations Research Letters
Authors: ,
Keywords: heuristics
Abstract:

We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for single source rent-or-buy by using the method of conditional expectation. Using the improved analysis of Eisenbrand, Grandoni and Rothvoß, our derandomized algorithm has an approximation guarantee of 3.28.

Reviews

Required fields are marked *. Your email address will not be published.