Abstract
This paper deals with the inverse eccentric vertex location problem on extended star networks in which the aim is to modify the edge lengths at the minimum overall cost within certain modification bounds so that a predetermined vertex becomes the farthest vertex from a given fixed vertex under the new edge lengths. Novel combinatorial algorithms with near-linear time complexities are developed for obtaining the optimal solution of the problem under different cost norms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
