The distance-domination numbers of trees

DOI10.1016/0167-6377(82)90005-0zbMATH Open0487.90049OpenAlexW1999059106MaRDI QIDQ1165765FDOQ1165765

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

algorithmdominating setchordal graphlocation on a graphmaximum coverage problem on treesp-center problemp-median problem on trees

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians

Cited In (10)

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