103 search results - page 4 / 21 » On-line Generalized Steiner Problem |
114
Voted
SODA
1996
ACM
15 years 6 months ago
1996
ACM
168
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
156
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
156
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
126
click to vote
IPCO
2007
15 years 6 months ago
2007
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...