LRC Digital repo
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Please use this identifier to cite or link to this item:
https://dspace.ctu.edu.vn/jspui/handle/123456789/5129Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nguyễn, Trung Kiên | - |
| dc.contributor.author | Shan, Erfang | - |
| dc.contributor.author | Bai, Chunsong | - |
| dc.contributor.author | Kang, Liying | - |
| dc.date.accessioned | 2018-11-21T07:59:14Z | - |
| dc.date.available | 2018-11-21T07:59:14Z | - |
| dc.date.issued | 2014 | - |
| dc.identifier.uri | http://localhost:8080//jspui/handle/123456789/5129 | - |
| dc.description.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. | vi_VN |
| dc.language.iso | en | vi_VN |
| dc.relation.ispartofseries | Discrete Optimization;13 .- p.16-22 | - |
| dc.subject | Location problem | vi_VN |
| dc.subject | Obnoxious facility | vi_VN |
| dc.subject | p-maxian | vi_VN |
| dc.subject | Cactus graphs | vi_VN |
| dc.title | The 2-maxian problem on cactus graphs | vi_VN |
| dc.type | Article | vi_VN |
| 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.133.148.222 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.