Spider Covers for Prize-Collecting Network Activation Problem

DOI10.1145/3132742zbMath1451.68202arXiv1310.5422OpenAlexW1675942548MaRDI QIDQ4554939

Takuro Fukunaga

Publication date: 12 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.5422

zbMATH Keywords

wireless networknetwork designLP rounding algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (2)

Approximating k-Connected m-Dominating Sets ⋮ On rooted \(k\)-connectivity problems in quasi-bipartite digraphs

This page was built for publication: Spider Covers for Prize-Collecting Network Activation Problem