𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An improved approximation for scattering problems (II)

✍ Scribed by P. Swan

Publisher
Elsevier Science
Year
1960
Weight
190 KB
Volume
21
Category
Article
ISSN
0029-5582

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improved Approximation Algorithms for Un
Improved Approximation Algorithms for Uniform Connectivity Problems
✍ Samir Khuller; Balaji Raghavachari πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 174 KB

The problem of finding minimum-weight spanning subgraphs with a given connectivity requirement is considered. The problem is NP-hard when the connectivity requirement is greater than one. Polynomial time approximation algorithms for various weighted and unweighted connectivity problems are given. Th

An improved approximation scheme for the
An improved approximation scheme for the Group Steiner Problem
✍ C. S. Helvig; Gabriel Robins; Alexander Zelikovsky πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 322 KB πŸ‘ 1 views

the Group Steiner Problem asks for a minimumcost tree which contains at least one node from each group N i N i N i . In this paper, we give polynomial-time O O O(k k k )approximation algorithms for any fixed > > > 0. This result improves the previously known O O O(k k k)-approximation. We also apply

An Improved Approximation Algorithm for
An Improved Approximation Algorithm for MULTIWAY CUT
✍ Gruia CΔƒlinescu; Howard Karloff; Yuval Rabani πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 132 KB

Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due

Electromagnetic scattering problems solv
Electromagnetic scattering problems solved by an improved spectral iteration technique
✍ Sandra Costanzo; Giuseppe Di Massa πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 202 KB

## Abstract The spectral iteration technique is used to solve electromagnetic scattering problems. A detailed analysis is carried out to investigate the convergence properties of the procedure, and a static solution is proposed as an initial estimate of the current to solve divergence problems. Dif

An improved solution procedure for creep
An improved solution procedure for creep problems
✍ C. W. Heaps; L. Mansfield πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 449 KB

A new simpler solution procedure is presented for the finite element analysis of creep problems. The creep strains are eliminated as computation variables. At each time step, a system is solved for the stresses and velocities alone.