Connected Set Cover Problem and Its Applications

DOI10.1007/11775096_23zbMath1137.90699OpenAlexW1870820630MaRDI QIDQ5434403

Xiao-Dong Hu, Tianping Shuai

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11775096_23

zbMATH Keywords

Approximation algorithmPerformance ratioSet coverWavelength assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

A simple approximation algorithm for minimum weight partial connected set cover ⋮ The relation of connected set cover and group Steiner tree ⋮ Complexity and approximation of the connected set-cover problem ⋮ On the hardness of full Steiner tree problems ⋮ Approximation algorithms for minimum weight partial connected set cover problem ⋮ Algorithms for connected set cover problem and fault-tolerant connected set cover problem

This page was built for publication: Connected Set Cover Problem and Its Applications