𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial time approximation algorithm for dynamic storage allocation

✍ Scribed by H.A. Kierstead

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
520 KB
Volume
88
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Polynomial time approximation algorithms
Polynomial time approximation algorithms for machine scheduling: ten open problems
✍ Petra Schuurman; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 91 KB πŸ‘ 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy

A Polynomial-time Algorithm for the Bist
A Polynomial-time Algorithm for the Bistable Roommates Problem
✍ Jay Sethuraman; Chung-Piaw Teo πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result

A Polynomial Time Algorithm for Diophant
A Polynomial Time Algorithm for Diophantine Equations in One Variable
✍ F CUCKER; P KOIRAN; S SMALE πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 195 KB

We exhibit an algorithm computing, for a polynomial f ∈ Z [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f .