447 search results - page 4 / 90 » Approximation Algorithms for Directed Steiner Problems |
112
click to vote
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
SIAMCOMP
2008
14 years 11 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
CCCG
2007
15 years 1 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
100
Voted
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...