approximating the minimum tour cover of a digraph近似的最小旅行的有向图.pdfVIP

approximating the minimum tour cover of a digraph近似的最小旅行的有向图.pdf

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
approximating the minimum tour cover of a digraph近似的最小旅行的有向图

Algorithms 2011, 4, 75-86; doi:10.3390/a4010075 OPEN ACCESS algorithms ISSN 1999-4893 /journal/algorithms Article Approximating the Minimum Tour Cover of a Digraph Viet Hung Nguyen ´ LIP6, Universite Pierre et Marie Curie Paris 6, 4 place Jussieu, Paris, France; E-Mail: hung.nguyen@lip6.fr Received: 2 March 2011; in revised form: 24 March 2011 / Accepted: 2 April 2011 / Published: 20 April 2011 Abstract: Given a directed graph with non-negative cost on the arcs, a directed tour cover of is a cycle (not necessarily simple) in such that either head or tail (or both of them) of every arc in is touched by . The minimum directed tour cover problem (DToCP), which is to find a directed tour cover of minimum cost, is -hard. It is thus interesting to design approximation algorithms with performance guarantee to solve this problem. Although its undirected counterpart (ToCP) has been studied in recent years, in our knowledge, the DToCP remains widely open. In this paper, we give a -approximation algorithm for the DToCP. Keywords: approximation algorithm; graph algorithm; packing and covering; tour cover; tree cover 1. Introduction Let be a directed graph with a (non-negative) cost function defined on the arcs. A directed tour cover is a subgraph such that 1. For every , contains an arc intersecting , i.e., and have at least one end-node in common. 2. is a closed directed walk (or branching in the cas

您可能关注的文档

文档评论(0)

118zhuanqian + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档