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

Authors:
David P. Williamson;Anke Van Zuylen
Affiliations:
School of Operations Research and Industrial Engineering, 206 Rhodes Hall, Cornell University, Ithaca, NY 14853, USA;School of Operations Research and Industrial Engineering, 206 Rhodes Hall, Cornell University, Ithaca, NY 14853, USA
Venue:
Operations Research Letters
Year:
2007

Citing 7
Cited 9

When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks

SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Simpler and better approximation algorithms for network design

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Primal–Dual Algorithms for Connected Facility Location Problems

Algorithmica
Tighter Bounds for Graph Steiner Tree Approximation

SIAM Journal on Discrete Mathematics
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Approximation via cost sharing: Simpler and better approximation algorithms for network design

Journal of the ACM (JACM)
Approximating connected facility location problems via random facility sampling and core detouring

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Deterministic Sampling Algorithms for Network Design

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A constant-factor approximation for stochastic Steiner forest

Proceedings of the forty-first annual ACM symposium on Theory of computing
A constant approximation algorithm for the a priori traveling salesman problem

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Connected facility location via random facility sampling and core detouring

Journal of Computer and System Sciences
Tree embeddings for two-edge-connected network design

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Strict Cost Sharing Schemes for Steiner Forest

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

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 Rothvosz, our derandomized algorithm has an approximation guarantee of 3.28.