Please use this identifier to cite or link to this item:
Title: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
Authors: Nguyễn, Trung Kiên
Sepasian, Ali Reza
Keywords: Location problem
Inverse optimization
1-center problem
Issue Date: 2015
Series/Report no.: Journal of Combinatorial Optimization;50 .- p.872–884
Abstract: This paper addresses the problem of modifying the edge lengths of a tree in minimum total cost such that a prespecified vertex becomes the 1-center of the perturbed tree. This problem is called the inverse 1-center problem on trees.We focus on the problem under Chebyshev norm and Hamming distance. From special properties of the objective functions, we can develop combinatorial algorithms to solve the problem. Precisely, if there does not exist any vertex coinciding with the prespecified vertex during the modification of edge lengths, the problem under Chebyshev norm or bottleneck Hamming distance is solvable in O(n log n) time, where n + 1 is the number of vertices of the tree. Dropping this condition, the problem can be solved in O(n²) time.
URI: http://localhost:8080//jspui/handle/123456789/5204
Appears in Collections:Tạp chí quốc tế

Files in This Item:
File Description SizeFormat 
_file_621.36 kBAdobe PDFView/Open
Your IP:

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.