scientific article; zbMATH DE number 177560

MaRDI QIDQ4037431zbMATH OpenFDO

Authors Judit Bar-Ilan, David Peleg

Publication date 18 May 1993

zbMATH Keywords

\(\rho\)-dominating set\(k\)-tolerant setapproximation algorithmsbalanced \(\kappa\)-centersbalanced \(\kappa\)-weighted centerscenter allocationdistributed networkNP-hard

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18)

Recommendations

• How to Allocate Network Centers
• \(k\)-center problems with minimum coverage
• Improved approximation algorithms for capacitated fault-tolerant \(k\)-center
• An approximation algorithm for the edge-dilation \(k\)-center problem.
• scientific article; zbMATH DE number 2089224

Cited in

(16)

• Graph theoretical issues in computer networks
• Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
• On interval and circular-arc covering problems
• scientific article; zbMATH DE number 4020808 (Why is no real title available?)
• A polynomial time algorithm for finding the absolute center of a network
• How to Allocate Network Centers
• scientific article; zbMATH DE number 1990677 (Why is no real title available?)
• Efficient algorithms for centers and medians in interval and circular-arc graphs
• Graph clustering
• scientific article; zbMATH DE number 7075920 (Why is no real title available?)
• 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
• Distributed algorithm for finding a core of a tree network
• An approximation algorithm for the edge-dilation \(k\)-center problem.
• An improved algorithm for the p-center problem on interval graphs with unit lengths

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037431)