最小权值顶点覆盖问题的快速启发式算法

2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS) Pub Date : 2016-06-26 DOI:10.1109/ICIS.2016.7550782

Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, S. Masuda

{"title":"最小权值顶点覆盖问题的快速启发式算法","authors":"Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, S. Masuda","doi":"10.1109/ICIS.2016.7550782","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":336322,"journal":{"name":"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A fast heuristic for the minimum weight vertex cover problem\",\"authors\":\"Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, S. Masuda\",\"doi\":\"10.1109/ICIS.2016.7550782\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":336322,\"journal\":{\"name\":\"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIS.2016.7550782\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2016.7550782","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

给定一个顶点加权的无向图，寻找最小权值的顶点覆盖问题称为最小权值顶点覆盖问题(MWVCP)。它被称为np困难问题。本文提出了一种快速启发式算法。我们的算法是基于一种叫做“列表启发式”的简单算法。实验结果表明，与近似算法相比，该算法在较短的时间内计算出更好的解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A fast heuristic for the minimum weight vertex cover problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS)

自引率

0.00%

发文量