๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An optimal stopping time problem with time average cost in a bounded interval

โœ Scribed by Min Sun

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
427 KB
Volume
8
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A polynomial time heuristic for certain
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
โœ Svatopluk Poljak; Daniel Turzรญk ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 340 KB

We introduce a notion of ).-extendible property of graphs and prove: If P is a ).-extendible property (0<).<1), then for a connected graph G = (V, E) and an objective function c: E---\*R + one can construct a spanning subgraph H= (V, F) which has the property P and satisfies c(F) = ~. c(E) + ยฝ