𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for general packing problems and their application to the multicast congestion problem

✍ Scribed by Klaus Jansen; Hu Zhang

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
264 KB
Volume
114
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Slope packings and coverings, and generi
Slope packings and coverings, and generic algorithms for the discrete logarithm problem
✍ M. Chateauneuf; A. C. H. Ling; D. R. Stinson πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 138 KB

## Abstract We consider the set of slopes of lines formed by joining all pairs of points in some subset __S__ of a Desarguesian affine plane of prime order __p__. If all the slopes are distinct and non‐infinite, we have a __slope packing__; if every possible non‐infinite slope occurs, then we have

An approximate Aβˆ— algorithm and its appl
An approximate Aβˆ— algorithm and its application to the SCS problem
✍ Gaia Nicosia; Gianpaolo Oriolo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 123 KB

In this paper we deal with algorithm A \* and its application to the problem of ΓΏnding the shortest common supersequence of a set of sequences. A \* is a powerful search algorithm which may be used to carry out concurrently the construction of a network and the solution of a shortest path problem on

Algorithms for searching explicit AND/OR
Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
✍ P.P. Chakrabarti πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 756 KB

Chakrabarti, P.P., Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search, Artificial Intelligence 65 (1994) 329-345. We present algorithms for finding out optimal cost solutions of an explicit AND/OR graph. We show that these new algorithms can work on A