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

Codes of geometrical algorithms for the (weighted) minimum circle problem

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
115 KB
Volume
80
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On computing the number of code words wi
On computing the number of code words with minimum weight for cyclic codes
โœ Masami Mohri; Masakatsu Morii ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 264 KB ๐Ÿ‘ 2 views

The weight distribution is an important parameter that determines the performance of a code. The minimum distance and the number of corresponding codes that can be derived from the weight distribution, greatly affect the performance of the code. The decoding error probability and other performance m

A branch-and-cut algorithm for the resou
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
โœ Fischetti, Matteo; Vigo, Daniele ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 150 KB ๐Ÿ‘ 2 views

In this paper, we present a branch-and-cut algorithm for the exact solution of an NP-hard extension of the well-known Minimum-Weight Arborescence (MWA) problem, in which resource constraints for each node are considered. This Resource-Constrained Minimum-Weight Arborescence (RMWA) problem arises, e.