nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs:顶点覆盖,在密集的部一致超图几乎紧的近似边界.pdfVIP

  • 11
  • 0
  • 约4.83万字
  • 约 9页
  • 2016-03-12 发布于广东
  • 举报

nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs:顶点覆盖,在密集的部一致超图几乎紧的近似边界.pdf

nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs:顶点覆盖,在密集的部一致超图几乎紧的近似边界

Journal of Discrete Algorithms 33 (2015) 49–57 Contents lists available at ScienceDirect Journal of Discrete Algorithms /locate/jda Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs Marek Karpinski a,b,1, Richard Schmied a,∗,2 , Claus Viehmann a,3 a Dept. of Computer Science, University of Bonn, Germany b Hausdorff Ce

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档