scientific article; zbMATH DE number 1163715

MaRDI QIDQ4395328zbMATH OpenFDO

Authors Sudipto Guha, Samir Khuller

Publication date 1 October 1998

zbMATH Keywords

facility location problemsminimum dominating sets

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Recommendations

• Approximation algorithms for connected dominating sets
• Approximation algorithms for connected dominating sets
• Approximation algorithms for connected facility location problems
• Securely connected facility location in metric graphs

Cited in

(6)

• Approximation algorithms for connected dominating sets
• The online multicommodity connected facility location problem
• Wireless networking, dominating and packing
• Connected facility location via random facility sampling and core detouring
• A simple greedy approximation algorithm for the minimum connected k-center problem
• scientific article; zbMATH DE number 1076395 (Why is no real title available?)

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 Q4395328)