Computation of inverse 1-centre location problem on the weighted interval graphs

dc.contributor.author	Jana, Biswanath
dc.contributor.author	Mondal, Sukumar
dc.contributor.author	Pal, Madhumangal
dc.date.accessioned	2022-12-19T07:16:04Z
dc.date.available	2022-12-19T07:16:04Z
dc.date.issued	2017
dc.identifier.issn	1752-5055
dc.identifier.issn	1752-5063
dc.identifier.uri	http://111.93.204.14:8080/xmlui/handle/123456789/1156
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Computing Science and Mathematics	en_US
dc.subject	Tree-networks	en_US
dc.subject	Centre location	en_US
dc.subject	1-centre location	en_US
dc.subject	Inverse 1-centre location	en_US
dc.subject	Inverse optimisation	en_US
dc.subject	Interval graphs	en_US
dc.title	Computation of inverse 1-centre location problem on the weighted interval graphs	en_US
dc.type	Article	en_US