Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems

DOI10.1007/978-3-662-43951-7_48zbMath1411.68021OpenAlexW821239940MaRDI QIDQ5167870

R. Ravi, Afshin Nikzad

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43951-7_48

zbMATH Keywords

graph algorithmsapproximation algorithms\(b\)-matchingLP rounding

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Multicommodity Multicast, Wireless and Fast

This page was built for publication: Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems