✦ LIBER ✦

A distributed dual ascent algorithm for Steiner problems in multicast routing

✍ Scribed by Lúcia M. A. Drummond; Marcelo Santos; Eduardo Uchoa

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 261 KB
Volume: 53
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20276

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lagrangean dual ascent algorithm for s

A Lagrangean dual ascent algorithm for simple plant location problems

✍ Monique Guignard 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 539 KB

A primal-dual approximation algorithm fo

A primal-dual approximation algorithm for the Steiner forest problem

✍ R. Ravi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 502 KB

Lagrangean dual ascent algorithms for co

Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems

✍ Monique Guignard; Kongkiat Opaswongkarn 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 551 KB

A dual ascent algorithm for the 1-tree r

A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem

✍ Kavindra Malik; Marshall L. Fisher 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 504 KB

A branch and cut algorithm for the Stein

A branch and cut algorithm for the Steiner problem in graphs

✍ Lucena, A.; Beasley, J. E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 2 views

In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraint

A faster approximation algorithm for the

A faster approximation algorithm for the steiner tree problem in graphs

✍ Alexander Z. Zelikovsky 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 369 KB