|
ヤマグチ カズアキ
Kazuaki Yamaguchi
山口 一章 所属 追手門学院大学 理工学部 情報工学科 職種 教授 |
|
| 言語種別 | 英語 |
| 発行・発表の年月 | 2016/06 |
| 形態種別 | 外国学会誌（その他） |
| 査読 | 査読あり |
| 標題 | A Fast Heuristic for the Minimum Weight Vertex Cover Problem |
| 執筆形態 | 共著・編著（代表編著を除く） |
| 掲載誌名 | 2016 IEEE/ACIS 15TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS) |
| 出版社・発行元 | IEEE COMPUTER SOC |
| 巻・号・頁 | pp.341-345 |
| 担当区分 | 責任著者 |
| 著者・共著者 | Satoshi Shimizu,Kazuaki Yamaguchi,Toshiki Saitoh,Sumio Masuda |
| 概要 | Given a vertex-weighted undirected graph, to find the vertex cover of minimum weight is called minimum weight vertex cover problem (MWVCP). It is known as an NP-hard problem. In this paper, a fast heuristic for MWVCP is proposed. Our algorithm is based on a simple algorithm called "list-heuristic." Experimenal results show that our algorithm calculates better solutions in shorter time than approximation algorithms for MWVCP. |
| DOI | 10.1109/ICIS.2016.7550782 |
| DBLP ID | conf/ACISicis/ShimizuYSM16 |
| PermalinkURL | https://dblp.uni-trier.de/rec/conf/ACISicis/2016 |
| researchmap用URL | https://dblp.uni-trier.de/db/conf/ACISicis/ACISicis2016.html#ShimizuYSM16 |