Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
From MaRDI portal
Publication:3558348
DOI10.1007/978-3-642-13193-6_17zbMath1434.68672arXiv1007.0372OpenAlexW1581948717MaRDI QIDQ3558348
Magnus Wahlström, Benjamin Doerr, Marvin Künnemann
Publication date: 4 May 2010
Published in: Experimental Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.0372
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (1)
This page was built for publication: Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
