Please use this identifier to cite or link to this item: https://dspace.ctu.edu.vn/jspui/handle/123456789/4421
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNguyễn, Trung Kiên-
dc.contributor.authorHuỳnh, Đức Quốc-
dc.contributor.authorLy, Hong Hai-
dc.contributor.authorPham, Van Chien-
dc.date.accessioned2018-09-19T08:22:40Z-
dc.date.available2018-09-19T08:22:40Z-
dc.date.issued2017-
dc.identifier.issn1932-9466-
dc.identifier.urihttp://dspace.ctu.edu.vn/jspui/handle/123456789/4421-
dc.description.abstractWe address the problem of finding a 1-median on a cactus graph. The problem has already been solved in linear time by the algorithms of Burkard and Krarup (1998), and Lan and Wang (2000). These algorithms are complicated and need efforts. Hence, we develop in this paper a simpler algorithm. First, we construct a condition for a cycle that contains a 1-median or for a vertex that is indeed a 1-median of the cactus. Based on this condition, we localize the search for deriving a 1-median on the underlying cactus. Complexity analysis shows that the approach runs in linear time.vi_VN
dc.language.isoenvi_VN
dc.relation.ispartofseriesApplications and Applied Mathematics;12 .- p.70-77-
dc.subjectMedian problemvi_VN
dc.subjectFacilitiesvi_VN
dc.subjectCactus graphsvi_VN
dc.subjectTreevi_VN
dc.subjectComplexityvi_VN
dc.subjectAlgorithmvi_VN
dc.subjectLinearvi_VN
dc.titleA Simple Linear Time Algorithm for Computing a 1-Median on Cactus Graphsvi_VN
dc.typeArticlevi_VN
Appears in Collections:Tạp chí quốc tế

Files in This Item:
File Description SizeFormat 
_file_465.13 kBAdobe PDFView/Open
Your IP: 44.192.38.49


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.