论文信息 - On the Solution Value of the Continuous p-Center Location Problem on a Graph

On the Solution Value of the Continuous p-Center Location Problem on a Graph

Let G = V, E be an undirected graph with positive edge lengths. Let rp denote the solution value to the continuous p-center location problem on G. We prove that rp is of the form rp = T/2q, where T is the length of an Euler tour of a subgraph of G which belongs to one of four possible types, and q is an integer, 1 ≤ q ≤ 2p. We also discuss algorithmic implications of this result.

Arie Tamir | A. Tamir

[1] Arie Tamir. A finite algorithm for the continuousp-center location problem on a graph , 1985, Math. Program..

[2] Donald B. Johnson,et al. Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures , 1983, J. Algorithms.

[3] Nimrod Megiddo,et al. New Results on the Complexity of p-Center Problems , 1983, SIAM J. Comput..

[4] Christos H. Papadimitriou. Efficient Search for Rationals , 1979, Inf. Process. Lett..

[5] S. L. HAKIMIt. AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[6] Gabriel Y. Handler,et al. The continuous m-center problem on a network , 1985, Networks.

[7] Donald B. Johnson,et al. The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns , 1982, J. Comput. Syst. Sci..

[8] Uzi Vishkin,et al. Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems , 1984, JACM.

[9] Nimrod Megiddo,et al. An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems , 1981, SIAM J. Comput..

[10] R. Chandrasekaran,et al. Location on Tree Networks: P-Centre and n-Dispersion Problems , 1981, Math. Oper. Res..