A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Filters
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
2007
Algorithmica
Preserved Fulltext
Using this method, optimal algorithms are devised for solving the conditional extensive weighted 1-center location problem in trees. ...
In this paper we consider the problem of locating path-shaped or tree-shaped (extensive) facility in trees under the conditions that exisiting facilities are already located. ...
We then propose optimal algorithms for the extensive facility location problems in trees, where the new facility (center) is either path-shaped or tree-shaped. ...
doi:10.1007/s00453-007-9157-8
fatcat:a244lkyuwnbdzijgii7jvzsczu
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Using this method, optimal algorithms are devised for solving the conditional extensive weighted 1-center location problem in trees. ...
In this paper we consider the problem of locating path-shaped or tree-shaped (extensive) facility in trees under the conditions that exisiting facilities are already located. ...
We then propose optimal algorithms for the extensive facility location problems in trees, where the new facility (center) is either path-shaped or tree-shaped. ...
doi:10.1007/11940128_39
fatcat:5zaeqycs6vcjbjwxuput3oykmq
The connected p-center problem on block graphs with forbidden vertices
2012
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Given a positive integer p, the p-Center problem involves finding a set Q with p vertices of G to be the locations for building facilities. ...
Then, the algorithmic result is extended to handle the situation in which some vertices in G cannot be included to form feasible solutions. The complexity of the extended algorithm is also O(n + m). ...
Acknowledgement This research was supported by National Science Council, Taiwan, under the contract number 98-2221-E-128-004. ...
doi:10.1016/j.tcs.2011.12.013
fatcat:yyrkwywnwzdwjkvuwyaayvndna