𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximation algorithm for the license and shift class design problem

✍ Scribed by Klaus Jansen

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
372 KB
Volume
73
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An approximation algorithm for the -leve
An approximation algorithm for the -level stochastic facility location problem
✍ Zhen Wang; Donglei Du; Adriana F. Gabor; Dachuan Xu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 268 KB

We consider the k-level stochastic facility location problem. For this, we present an LP rounding algorithm that is 3-approximate. This result is achieved by a novel integer linear programming formulation that exploits the stochastic structure.

An improved approximation algorithm for
An improved approximation algorithm for the partial Latin square extension problem
✍ Carla P. Gomes; Rommel G. Regis; David B. Shmoys πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 203 KB

The problem of completing partial latin squares arises in a number of applications, including conflict-free wavelength routing in wide-area optical networks, statistical designs, and error-correcting codes. A partial latin square is an n by n array such that each cell is either empty or contains exa

FURTHER DEVELOPMENT OF AN ALTERNATIVE AL
FURTHER DEVELOPMENT OF AN ALTERNATIVE ALGORITHM FOR A CLASS OF H∞ DESIGN PROBLEMS
✍ T. C. YANG πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 316 KB πŸ‘ 2 views

This article presents a tutorial exposition of an algorithm suggested by Kwakernaak which is an alternative to the standard state space solution for a class of H optimization problems. In addition, a set of formulae for the computation required is derived. From these formulae one can simply use an o