請用此 Handle URI 來引用此文件: http://hdl.handle.net/11455/38340
標題: 1-segment Center Problems
作者: H.Imai
D.T.Lee
C.D.Yang
關鍵字: facilities/equipment planning
discrete facility location
analysis of algorithms: computational complexity
computational geometry: geometric location
minimax optimization
computational geometry
geometric facility location
minimax optimization
摘要: We consider a minimax facility location problem for n points such that the facility is a line segment of a given length. The general problem can be solved by case analysis in O(n4 log n) time. When the orientation of the segment is fixed, the problem is shown to be linear-time solvable by using the prune-and-search technique. Other variations of this problem are also discussed.
URI: http://hdl.handle.net/11455/38340
ISSN: 1091-9856
顯示於類別:資訊科學與工程學系所

文件中的檔案:
沒有與此文件相關的檔案。


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。