| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652718 | Electronic Notes in Discrete Mathematics | 2010 | 6 Pages |
Abstract
We investigate the inverse 1-center location problem on trees and outline combinatorial algorithms with time complexity O(n2) in case that the topology of the tree does not change. In the uniform cost model an improved running time of O(n log n) can be obtained. If topology changes occur, the complexity increases by a factor bounded by n. This improves earlier results of Yang and Zhang.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
