𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Improved Approximation Algorithm for Multicastk-Tree Routing

✍ Scribed by Guohui Lin

Publisher
Springer US
Year
2005
Tongue
English
Weight
553 KB
Volume
9
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improved Approximation Algorithms for Tr
Improved Approximation Algorithms for Tree Alignment
✍ Lusheng Wang; Dan Gusfield πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 251 KB

Multiple sequence alignment is a task at the heart of much of current computaw x tional biology 4 . Several different objective functions have been proposed to formalize the task of multiple sequence alignment, but efficient algorithms are lacking in each case. Thus multiple sequence alignment is on

An Improved Approximation Algorithm for
An Improved Approximation Algorithm for MULTIWAY CUT
✍ 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

An efficient hierarchical timing-driven
An efficient hierarchical timing-driven Steiner tree algorithm for global routing
✍ Jingyu Xu; Xianlong Hong; Tong Jing; Yici Cai; Jun Gu πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 425 KB

In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as the goal. The algorithm uses heuristic approach to decompose the problem of minimum delay Steiner tree into hierarchy and