## Abstract We experimentally evaluate sequential and distributed implementations of an approximation partitioning algorithm by Kalpakis and Sherman for the __Geometric Steiner Minimum Tree Problem (GSMT)__ in __R^d^__ for __d__ = 2,3. Our implementations incorporate an improved method for combinin
The implementation of insertion and deletion algorithms for 1–2 brother trees
✍ Scribed by Th. Ottmann; H. -W. Six; D. Wood
- Publisher
- Springer Vienna
- Year
- 1981
- Tongue
- English
- Weight
- 422 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0010-485X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper presents a simple divide-and-conquer algorithm for computing the prime tree decomposition of a two-structure. The algorithm runs in \(O\left(n^{2}\right)\) time, when \(n\) is the number of nodes of the two-structure. A directed or undirected graph is a special case of a two-structure, an
## Abstract A simple genetic algorithm for the numerical evaluation of binodal curves in ternary systems polymer–liquid (1)–liquid (2) and polymer (1)–polymer (2)–solvent is presented. The technique exploits a specifically developed restarting technique based on a combined elitist and zooming strat
Deletions of 11q in chronic lymphocytic leukemia (CLL) are usually associated with progressive disease and poor prognosis. A novel translocation within the previously identified 11q minimal region has been defined in a patient with CLL. The breakpoint is between genes POU2AF1 and BTG4. POU2AF1 is a