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

Algorithm for circle approximation and generation

โœ Scribed by L. Yong-Kui

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
130 KB
Volume
25
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Combinatorial Approximation Algorithms f
Combinatorial Approximation Algorithms for Generalized Flow Problems
โœ Jeffrey D Oldham ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 226 KB

Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier ยต v w for each arc v w . For every unit of flow entering the arc, ยต v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi

Effective algorithms for circle fitting
Effective algorithms for circle fitting
โœ N.I. Chernov; G.A. Ososkov ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 422 KB

After an investigation of known methods for circle fitting two new effective algorithms are proposed which meet all the requirements of mass data handling. I

Approximation algorithms for general one
Approximation algorithms for general one-warehouse multi-retailer systems
โœ Zuo-Jun Max Shen; Jia Shu; David Simchi-Levi; Chung-Piaw Teo; Jiawei Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 261 KB

## Abstract Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales,

Approximation Algorithms for Broadcastin
Approximation Algorithms for Broadcasting and Gossiping
โœ Pierre Fraigniaud; Sandrine Vial ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 152 KB

Broadcasting and gossiping are two basic communication patterns which commonly occur when programming parallel and distributed systems. This paper deals with approximation algorithms for solving these problems on arbitrary topologies. We present new strategies to derive efficient broadcasting and go