The distance-domination numbers of trees

DOI10.1016/0167-6377(82)90005-0MaRDI QIDQ1165765zbMATH OpenOpenAlexFDO

Authors S. Singh

Publication date 1982

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(82)90005-0

zbMATH Keywords

algorithmchordal graphdominating setlocation on a graphmaximum coverage problem on treesp-center problemp-median problem on trees

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Inventory, storage, reservoirs (90B05) Programming involving graphs or networks (90C35)

Cites work

• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(10)

• Improved complexity bounds for location problems on the real line
• On domination and reinforcement numbers in trees
• An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
• The general facility location problem with connectivity on trees
• A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
• A large class of facets for the \(K\)-median polytope
• Optimizing server placement in distributed systems in the presence of competition
• Bibliography on domination in graphs and some basic definitions of domination parameters
• The weighted perfect domination problem
• On the \(p\)-median polytope of \(Y\)-free graphs

This page was built for publication: The distance-domination numbers of trees

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