街道清扫问题的近似算法

2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE) Pub Date : 2014-12-08 DOI:10.1109/ICEEE.2014.6978276

Luis Francisco Hernández Sánchez, Laura Chávez-Lomelí, F. Martínez

{"title":"街道清扫问题的近似算法","authors":"Luis Francisco Hernández Sánchez, Laura Chávez-Lomelí, F. Martínez","doi":"10.1109/ICEEE.2014.6978276","DOIUrl":null,"url":null,"abstract":"The Street sweeping problem (SSP) is a variation of the Windy postman problem (WPP) in which we must construct two tours traversing every edge, and each edge must be traversed once in each direction: one on the first tour and the opposite in the second tour. The computational complexity of this problem remains open. We present a (3/2 α + 1)-approximation algorithm for the SSP using an α-approximation algorithm for the WPP. We also present exact algorithms for some classes of graphs.","PeriodicalId":6661,"journal":{"name":"2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)","volume":"97 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Approximation algorithms for the Street sweeping problem\",\"authors\":\"Luis Francisco Hernández Sánchez, Laura Chávez-Lomelí, F. Martínez\",\"doi\":\"10.1109/ICEEE.2014.6978276\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Street sweeping problem (SSP) is a variation of the Windy postman problem (WPP) in which we must construct two tours traversing every edge, and each edge must be traversed once in each direction: one on the first tour and the opposite in the second tour. The computational complexity of this problem remains open. We present a (3/2 α + 1)-approximation algorithm for the SSP using an α-approximation algorithm for the WPP. We also present exact algorithms for some classes of graphs.\",\"PeriodicalId\":6661,\"journal\":{\"name\":\"2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)\",\"volume\":\"97 1\",\"pages\":\"1-4\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEEE.2014.6978276\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEEE.2014.6978276","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

扫街问题(SSP)是风邮差问题(WPP)的一个变体，在这个问题中，我们必须构造两次遍历每条边，每条边必须在每个方向上遍历一次:第一次遍历一次，第二次遍历一次。这个问题的计算复杂性仍然是开放的。利用WPP的α-近似算法，提出了SSP的(3/2 α + 1)近似算法。我们也给出了一些图的精确算法。

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

查看原文本刊更多论文

Approximation algorithms for the Street sweeping problem

The Street sweeping problem (SSP) is a variation of the Windy postman problem (WPP) in which we must construct two tours traversing every edge, and each edge must be traversed once in each direction: one on the first tour and the opposite in the second tour. The computational complexity of this problem remains open. We present a (3/2 α + 1)-approximation algorithm for the SSP using an α-approximation algorithm for the WPP. We also present exact algorithms for some classes of graphs.

求助全文

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

来源期刊

2014 11th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)

自引率

0.00%

发文量