An improved quasilongitudinal approximation for whistler-mode waves
β Scribed by S.S. Sazhin
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 697 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0032-0633
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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