Scholarlink

<p>Answering a question of Gamarnik and Smedira&#xa0;[<CitationRef CitationID="CR15">15</CitationRef>], we give a polynomial time algorithm that approximately computes the volume of a truncation of a relaxation of the independent set polytope, improving on their quasi-polynomial time algorithm. Our algorithm is obtained by viewing the volume as an evaluation of a graph polynomial and we approximate this evaluation using Barvinok’s interpolation method.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Approximating the Volume of a Truncated Relaxation of the Independence Polytope

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年2月28日

查看全文
  • Ferenc Bencs,
  • Guus Regts

摘要

Answering a question of Gamarnik and Smedira [15], we give a polynomial time algorithm that approximately computes the volume of a truncation of a relaxation of the independent set polytope, improving on their quasi-polynomial time algorithm. Our algorithm is obtained by viewing the volume as an evaluation of a graph polynomial and we approximate this evaluation using Barvinok’s interpolation method.