The general facility location problem with connectivity on trees

Authors
Shan, Er Fang Kang, Li Ying
Citation
Shan, Er Fang et Kang, Li Ying, The general facility location problem with connectivity on trees, Acta mathematica Sinica. English series (Print) , 32(9), 2016, pp. 1106-1112
Journal title
Acta mathematica Sinica. English series (Print) → ACNP
ISSN journal
14398516
Volume
32
Issue
9
Year of publication
2016
Pages
1106 - 1112
Database
ACNP
SICI code
Abstract
In this note we study the general facility location problem with connectivity. We present an O(np 2)-time algorithm for the general facility location problem with connectivity on trees. Furthermore, we present an O(np)-time algorithm for the general facility location problem with connectivity on equivalent binary trees.