The 2-radius and 2-radiian problems on trees

DOI10.1016/J.TCS.2008.08.022MaRDI QIDQ955029zbMATH OpenOpenAlexFDO

Authors Hung-Lung Wang, Kun-Mao Chao

Publication date 18 November 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.08.022

zbMATH Keywords

treemediancenterradiusfacility location problemcentdianradiian

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Discrete location and assignment (90B80)

Recommendations

• Locating Facilities on a Network to Minimize Their Average Service Radius
• Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
• The balanced 2-median and 2-maxian problems on a tree
• scientific article; zbMATH DE number 2081038
• The centdian subtree on tree networks

Cites work

• scientific article; zbMATH DE number 1617247 (Why is no real title available?)
• scientific article; zbMATH DE number 177557 (Why is no real title available?)
• scientific article; zbMATH DE number 2081038 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A linear-time algorithm for solving the center problem on weighted cactus graphs
• A polynomial algorithm for thep-centdian problem on a tree
• Algorithms and Computation
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Computing the 2‐median on tree networks in O(n lg n) time
• Duality in the Cent-Dian of a Graph
• Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Locating Facilities on a Network to Minimize Their Average Service Radius
• Medi-Centers of a Tree
• Minimizing the sum of the \(k\) largest functions in linear time.
• Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
• Spanning Trees and Optimization Problems
• The backup 2‐center and backup 2‐median problems on trees
• The centdian subtree on tree networks

Cited in

(6)

• Tree polytope on 2-trees
• The extensive 1-median problem with radius on networks
• Locating Facilities on a Network to Minimize Their Average Service Radius
• Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
• A two-spheres problem on homogeneous trees
• The solutions of two star-height problems for regular trees

This page was built for publication: The 2-radius and 2-radiian problems on trees

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