The Conditional Location of a Median Path

Authors:
Biing-Feng Wang;Shan-Chyun Ku;Yong-Hsian Hsieh
Affiliations:
-;-;-
Venue:
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Year:
2002

Citing 7
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
Nonlinearity of Daveport:80Schinzel sequences and of generalized path compression schemes

Combinatorica
Fully polynomial approximation schemes for locating a tree-shaped facility: a generalization of the knapsack problem

Discrete Applied Mathematics
Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network

Journal of Algorithms
Finding a 2-Core of a Tree in Linear Time

SIAM Journal on Discrete Mathematics
Maintaining Center and Median in Dynamic Trees

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Finding Cores of Limited Length

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures

Core and Conditional Core Path of Specified Length in Special Classes of Graphs

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of locating a median path of limited length on a tree under the condition that some existing facilities are already located. The existing facilities may be located at any subset of vertices. Upper and lower bounds are proposed for both the discrete and continuous models. In the discrete model, a median path is not allowed to contain partial edges. In the continuous model, a median path may contain partial edges. The proposed upper bounds for these two models are O(nlog n) and O(nlog n驴(n)), respectively. They improve the previous ones from O(nlog2 n) and O(n2), respectively. The proposed lower bounds are both 驴(nlog n). The lower bounds show that our upper bound for the discrete model is optimal and the margin for possible improvement on our upper bound for the continuous model is slim.