๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A polynomial approximation scheme for the subset sum problem

โœ Scribed by Nei Yoshihiro Soma; Alan Solon Ivor Zinober; Horacio Hideki Yanasse; Peter John Harley

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
462 KB
Volume
57
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient fully polynomial approximat
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
โœ Hans Kellerer; Renata Mansini; Ulrich Pferschy; Maria Grazia Speranza ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 238 KB

Given a set of n positive integers and a knapsack of capacity c; the Subset-Sum Problem is to find a subset the sum of which is closest to c without exceeding the value c: In this paper we present a fully polynomial approximation scheme which solves the Subset-Sum Problem with accuracy e in time Oรฐm

A fully polynomial bicriteria approximat
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
โœ Sung-Pil Hong; Sung-Jin Chung; Bum Hwan Park ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 213 KB

We propose a fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. First, an exact pseudo-polynomial algorithm is developed based on a two-variable extension of the well-known matrix-tree theorem. The scaling and approximate binary search techniques are then uti