The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance

Kien Trung Nguyen () and Ali Reza Sepasian ()
Additional contact information
Kien Trung Nguyen: Cantho University
Ali Reza Sepasian: Fasa University

Journal of Combinatorial Optimization, 2016, vol. 32, issue 3, No 14, 872-884

Abstract: 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)$$ O ( n log n ) time, where $$n+1$$ n + 1 is the number of vertices of the tree. Dropping this condition, the problem can be solved in $$O(n^{2})$$ O ( n 2 ) time.

Keywords: Location problem; Inverse optimization; 1-center problem; Tree (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9907-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:3:d:10.1007_s10878-015-9907-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9907-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().