An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs

DOI10.1016/S0377-2217(99)00080-6zbMath0961.90120MaRDI QIDQ1577108

Yu-Feng Lan, Yue-Li Wang

Publication date: 30 August 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

optimizationgraph theorylocationcactus graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

The connected \(p\)-median problem on block graphs ⋮ Spanning cactus: complexity and extensions ⋮ Continuous mean distance of a weighted graph ⋮ A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ Exploiting Structure: Location Problems on Trees and Treelike Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locating an absolute center on graphs that are almost trees
• Distributed algorithms for finding centers and medians in networks
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
• Block-vertex duality and the one-median problem
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs