An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution

Ei Ando, Shuji Kijima

研究成果: ジャーナルへの寄稿学術誌査読

5 被引用数 (Scopus)

抄録

Computing high dimensional volumes is a hard problem, even for approximation. Several randomized approximation techniques for #P-hard problems have been developed in the three decades, while some deterministic approximation algorithms are recently developed only for a few #P-hard problems. Motivated by a new technique for a deterministic approximation, this paper is concerned with the volume computation of 0-1 knapsack polytopes, which is known to be #P-hard. This paper presents a new technique based on approximate convolutions for a deterministic approximation of volume computations, and provides a fully polynomial-time approximation scheme for the volume computation of 0-1 knapsack polytopes. We also give an extension of the result to multi-constrained knapsack polytopes with a constant number of constraints.

本文言語英語
ページ(範囲)1245-1263
ページ数19
ジャーナルAlgorithmica
76
4
DOI
出版ステータス出版済み - 12月 1 2016

!!!All Science Journal Classification (ASJC) codes

  • コンピュータ サイエンス(全般)
  • コンピュータ サイエンスの応用
  • 応用数学

フィンガープリント

「An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル