The distance-domination numbers of trees
From MaRDI portal
Publication:1165765
DOI10.1016/0167-6377(82)90005-0zbMath0487.90049OpenAlexW1999059106MaRDI QIDQ1165765
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
algorithmchordal graphdominating setlocation on a graphmaximum coverage problem on treesp-center problemp-median problem on trees
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Inventory, storage, reservoirs (90B05)
Related Items (10)
A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices ⋮ The general facility location problem with connectivity on trees ⋮ Optimizing server placement in distributed systems in the presence of competition ⋮ The weighted perfect domination problem ⋮ Improved complexity bounds for location problems on the real line ⋮ On domination and reinforcement numbers in trees ⋮ On the \(p\)-median polytope of \(Y\)-free graphs ⋮ A large class of facets for the \(K\)-median polytope ⋮ An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
This page was built for publication: The distance-domination numbers of trees
