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

Improved algorithm for corner-cutting tunneling calculations

โœ Scribed by Fernandez-Ramos, Antonio; Truhlar, Donald G.


Book ID
120567751
Publisher
American Institute of Physics
Year
2001
Tongue
English
Weight
363 KB
Volume
114
Category
Article
ISSN
0021-9606

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Algorithm for depth-of-cut calculation
โœ V. A. Osipov; A. V. Grishkevich ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer ๐ŸŒ English โš– 351 KB
An Improved Approximation Algorithm for
โœ 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