Distribution-free upper bounds on the premiums of the LCR and ECOMOR treaties
β Scribed by Erhard Kremer
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 345 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0167-6687
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We give an exponential upper bound in p 4 on the size of any obstruction for path-width at most p. We give a doubly exponential upper bound in k 5 on the size of any obstruction for tree-width at most k. We also give an upper bound on the size of any intertwine of two given trees T and T $. The boun
## Abstract It is known that a planar graph on __n__ vertices has branchβwidth/treeβwidth bounded by $\alpha \sqrt {n}$. In many algorithmic applications, it is useful to have a small bound on the constant Ξ±. We give a proof of the best, so far, upper bound for the constant Ξ±. In particular, for th