scientific article
From MaRDI portal
Publication:4037431
zbMath0764.68059MaRDI QIDQ4037431
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-hardapproximation algorithmsdistributed network\(\rho\)-dominating set\(k\)-tolerant setbalanced \(\kappa\)-centersbalanced \(\kappa\)-weighted centerscenter allocation
Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items (8)
Efficient algorithms for centers and medians in interval and circular-arc graphs ⋮ An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths ⋮ Approximability results for the $p$-centdian and the converse centdian problems ⋮ Compact location problems with budget and communication constraints ⋮ Complexity and approximability of certain bicriteria location problems ⋮ Graph clustering ⋮ On interval and circular-arc covering problems ⋮ Graph theoretical issues in computer networks
This page was built for publication:
