✦ LIBER ✦

Unitarity of the tree approximation to the GlauberAAamplitude for largeA

✍ Scribed by M. A. Braun; A. V. Krylov

Book ID: 111441265
Publisher: SP MAIK Nauka/Interperiodica
Year: 2011
Tongue: English
Weight: 556 KB
Volume: 74
Category: Article
ISSN: 1063-7788
DOI: 10.1134/s1063778811020086

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An estimate of the correction to the str

An estimate of the correction to the strip-approximation from inelastic unitarity

✍ D. Morgan 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 286 KB

An alternative approach to the proof of

An alternative approach to the proof of unitarity for gauge theories

✍ G. Curci; R. Ferrari 📂 Article 📅 1976 🏛 Springer-Verlag ⚖ 245 KB

Improved Approximation Algorithms for th

Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

✍ Marek Karpinski; Ion I. Mandoiu; Alexander Olshevsky; Alexander Zelikovsky 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 175 KB

Approximating the Minimum-Degree Steiner

Approximating the Minimum-Degree Steiner Tree to within One of Optimal

✍ M. Furer; B. Raghavachari 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 691 KB

The problem of constructing a spanning tree for a graph \(G=(V, E)\) with \(n\) vertices whose maximal degree is the smallest among all spanning trees of \(G\) is considered. This problem is easily shown to be NP-hard. In the Steiner version of this problem, along with the input graph, a set of dist

On efficient implementation of an approx

On efficient implementation of an approximation algorithm for the Steiner tree problem

✍ Lawrence T. Kou 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 689 KB

A series of approximation algorithms for

A series of approximation algorithms for the acyclic directed steiner tree problem

✍ A. Zelikovsky 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 739 KB