Computation of inverse 1-centre location problem on the weighted interval graphs. (2017)

• Record Type: Journal Article
• Authors: Jana, Biswanath; Mondal, Sukumar; Pal, Madhumangal
• Is Part Of: International journal of computing science and mathematics. Volume 8:Number 6(2017)
• Page Start: 533
• Page End: 541
• Publication Date: 2017
• Subjects: tree-networks -- centre location -- 1-centre location -- inverse 1-centre location -- inverse optimisation -- tree -- interval graphs; Mathematics -- Periodicals; Computer science -- Periodicals; Mathematics -- Data processing -- Periodicals; 510.285
• Languages: English
• ISSNs: 1752-5055

Abstract

Let TIG be the tree corresponding to the weighted interval graph G = ( V, E ). In an inverse 1-centre location problem the parameter of an interval tree TIG corresponding to the weighted interval graph G = ( V, E ), like vertex weights have to be modified at minimum total cost such that a pre-specified vertex s ∈ V becomes the 1-centre of the interval graph G . In this paper, we present an O ( n ) time algorithm to find an inverse 1-centre location problem on the weighted tree TIG corresponding to the weighted interval graph, where the vertex weights can be changed within certain bounds and n is the number of vertices of the graph G .