𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On-Line Algorithms for the Dynamic Traveling Repair Problem

✍ Scribed by Sandy Irani; Xiangwen Lu; Amelia Regan

Book ID
111594817
Publisher
Springer US
Year
2004
Tongue
English
Weight
146 KB
Volume
7
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient special case algorithms for th
Efficient special case algorithms for the n-line planar traveling salesman problem
✍ M. Cutler πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 482 KB

## Abstract The traveling salesman problem, path, or cycle is NP‐complete. All known exact solutions to this problem are exponential. In the __N‐line planar__ traveling salesman problem the points are on __N__ lines in the plane. In this paper, simple and efficient low‐degree polynomial solutions a

New On-Line Algorithms for the Page Repl
New On-Line Algorithms for the Page Replication Problem
✍ Susanne Albers; Hisashi Koga πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 210 KB

We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitive ratio can be given. We develop an optimal randomized on-line replication algorithm for trees and uniform networks; its