𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem

✍ Scribed by Zevi Miller; Dan Pritikin; Manley Perkel; I.H. Sudborough

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
331 KB
Volume
45
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Exponentially small bounds on the expect
Exponentially small bounds on the expected optimum of the partition and subset sum problems
✍ George S. Lueker πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 172 KB

In the partition problem we seek to partition a list of numbers into two sublists to minimize the difference between the sums of the two sublists. For this and the related subset sum problem, under suitable assumptions on the probability distributions of the input, it is known that the median of the

Lower Bounds for the Union–Find and the
Lower Bounds for the Union–Find and the Split–Find Problem on Pointer Machines
✍ Han La PoutrΓ© πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 490 KB

A well-known result of Tarjan states that for all n and m n there exists a sequence of n&1 Union and m Find operations that needs at least 0(m . :(m, n)) execution steps on a pointer machine that satisfies the separation condition. Later the bound was extended to 0(n+m. :(m, n)) for all m and n. In

An improved algorithm for the minmax reg
An improved algorithm for the minmax regret median problem on a tree
✍ Igor Averbakh; Oded Berman πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a β€œminmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because