𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems

✍ Scribed by Alon, N.; Azar, Y.; Csirik, J.; Epstein, L.; Sevastianov, S. V.; Vestjens, A. P. A.; Woeginger, G. J.

Book ID
113012479
Publisher
Springer
Year
1998
Tongue
English
Weight
151 KB
Volume
21
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Off-line algorithms for the list update
Off-line algorithms for the list update problem
✍ Nick Reingold; Jeffery Westbrook πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 637 KB

Optimum off-line algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to optimum algorithm which runs in time 02"( n -1) !m, where n is the

A faster off-line algorithm for the TCP
A faster off-line algorithm for the TCP acknowledgement problem
✍ John Noga; Steve Seiden; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 48 KB

In a recent paper [Proceedings of STOC'98, 1998, pp. 389-398], Dooly, Goldman and Scott study a problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgements in the Transmission Control Protocol (TCP). Among other results, they give an O(n 2 ) off-line algor