666 search results - page 11 / 134 » New primal-dual algorithms for Steiner tree problems |
ICDE
2009
IEEE
14 years 5 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
ESA
2008
Springer
13 years 12 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
COCOA
2008
Springer
13 years 12 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
ICCAD
1995
IEEE
14 years 1 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
ISAAC
1993
Springer
14 years 2 months ago
1993
Springer
