Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
From MaRDI portal
Publication:2931426
DOI10.1145/1132516.1132609zbMath1301.68271OpenAlexW2078850190MaRDI QIDQ2931426
Jochen Könemann, Lisa K. Fleischer, Guido Schäfer, Stefano Leonardi
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132609
Programming involving graphs or networks (90C35) Trees (05C05) Stochastic programming (90C15) Approximation algorithms (68W25)
Related Items (6)
Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing ⋮ Connected facility location via random facility sampling and core detouring ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ Approximation Algorithms for Single and Multi-Commodity Connected Facility Location ⋮ A simpler and better derandomization of an approximation algorithm for single source rent-or-buy ⋮ Deterministic sampling algorithms for network design
This page was built for publication: Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
