Please use this identifier to cite or link to this item:
https://dspace.ctu.edu.vn/jspui/handle/123456789/5129
Title: | The 2-maxian problem on cactus graphs |
Authors: | Nguyễn, Trung Kiên Shan, Erfang Bai, Chunsong Kang, Liying |
Keywords: | Location problem Obnoxious facility p-maxian Cactus graphs |
Issue Date: | 2014 |
Series/Report no.: | Discrete Optimization;13 .- p.16-22 |
Abstract: | This paper deals with the 2-maxian problem on cactus graphs. It is shown that in the worst case the midpoint of any path connecting m₁ and m₂, where {m₁,m₂} is the 2-maxian of the cactus, lies on a specified cycle. Based on this property, we develop an algorithm with time complexity of O(n²) for the problem on a cactus with n vertices. |
URI: | http://localhost:8080//jspui/handle/123456789/5129 |
Appears in Collections: | Tạp chí quốc tế |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
_file_ | 413.32 kB | Adobe PDF | View/Open | |
Your IP: 3.149.238.67 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.