𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Better Approximation for Balls

✍ Scribed by Gerald H.L. Cheang; Andrew R. Barron

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
209 KB
Volume
104
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Better Approximation Algorithm for Fin
A Better Approximation Algorithm for Finding Planar Subgraphs
✍ Gruia CΔƒlinescu; Cristina G Fernandes; Ulrich Finkler; Howard Karloff πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 321 KB

The MAXIMUM PLANAR SUBGRAPH problemᎏgiven a graph G, find a largest planar subgraph of Gᎏhas applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for this NP-Complete problem was known to achieve a performance ratio larger than 1r3,

A Better Approximation Ratio for the Min
A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
✍ Cristina G Fernandes πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 213 KB

Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algo

Approximation of rolling-ball blends for
Approximation of rolling-ball blends for free-form parametric surfaces
✍ Rida Amt Farouki; Ragnar Sverrisson πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 992 KB

PrInted !n Great Brbain. All rights reserved OOIO-4485196 515.00+0 00 approximation are employed to govern the magnitude of the arc-length steps along the spine curve, and hence to guarantee the satisfaction of specified tolerances.