Spider covers for prize-collecting network activation problem
From MaRDI portal
Publication:5363079
DOI10.1137/1.9781611973730.2zbMath1371.68206OpenAlexW2950379331MaRDI QIDQ5363079
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.2
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (5)
Unnamed Item ⋮ Covering problems in edge- and node-weighted graphs ⋮ Approximation algorithms for highly connected multi-dominating sets in unit disk graphs ⋮ Spider Covering Algorithms for Network Design Problems ⋮ On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
This page was built for publication: Spider covers for prize-collecting network activation problem
