a polyhedral study of the maximum edge subgraph problem:多面体研究的最大边子图问题.pdfVIP

a polyhedral study of the maximum edge subgraph problem:多面体研究的最大边子图问题.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文档。上传文档
查看更多
a polyhedral study of the maximum edge subgraph problem:多面体研究的最大边子图问题

Discrete Applied Mathematics 160 (2012) 2573–2590 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: /locate/dam A polyhedral study of the maximum edge subgraph problem Flavia Bonomo a,∗, Javier Marenco b , Daniela Saban c,b , Nicolás E. Stier-Moses d a Depto. de Computación, FCEyN, Universidad de Buenos Aires and IMAS–CONICET, Argentina b Instituto de Ciencias, Universidad Nacional de General Sarmiento, Argentina c Depto. de Computación, FCEyN, Universidad de Buenos Aires, Argentina d Graduate School of Business, Columbia University, USA a r t i c l e i n f o a b s t r a c t Article history: The study of cohesive subgroups is an important aspect of social network analysis. Cohesive Received 16 April 2010 subgroups are studied using different relaxations of the notion of clique in a graph. For Received in revised form 25 July 2011 instance, given a graph and an integer k, the maximum edge subgraph problem consists of Accepted 8 October 2011 finding a k-vertex subset such that the number of edges within the subset is maximum. This Available online 4 November 2011 work proposes a polyhedral approach for this NP-hard problem. We study the polytope associated to an integer programming formulation of the problem, present several families Keywords: of facet-inducing valid inequalities, and discuss the separation problem associated to Polyhedral combinatorics Quasi-cliques

您可能关注的文档

文档评论(0)

ajgoaw + 关注
文档贡献者

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

1亿VIP精品文档

相关文档