Title of article
Inverse center location problems
Author/Authors
Burkard، نويسنده , , Rainer E. and Alizadeh، نويسنده , , Behrooz، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
6
From page
105
To page
110
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.
Keywords
tree height reduction , Inverse optimization , height balancing , center location problem
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455364
Link To Document