中文

Journal of Shanghai University >

2011 , Vol. 17 >Issue 3: 259 - 262

DOI: https://doi.org/10.3969/j.issn.1007-2861.2011.03.008

Mathematics.Physics and Chemistry

Unweighted 1-Center Problem on Block Graphs

Expand
  • College of Sciences, Shanghai University, Shanghai 200444, China

Received date: 2010-01-12

  Online published: 2011-06-24

Fold

Abstract

In the pcenter problem, p facilities are located in the network such that the maximum weighted distance from a client to its nearest facility is minimized. If all client weights are equal to 1, it is called an unweighted center problem. Unweighted 1-center problem is studied on block graphs with a unit edge length. It is shown that the problem can be solved in linear time using the tree structure of a block graph.

Key words： block graph; center problem; location problems; networks

Cite this article

ZHANG Xiao-Qin, KANG Li-Yang . Unweighted 1-Center Problem on Block Graphs[J]. Journal of Shanghai University, 2011 , 17(3) : 259 -262 . DOI: 10.3969/j.issn.1007-2861.2011.03.008

Options
Outlines

/

〈 〉