2 search results - page 1 / 1 » Approximate Min-Max Theorems of Steiner Rooted-Orientations ... |
FOCS
2006
IEEE
13 years 10 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...
JCT
2008
13 years 4 months ago
2008
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 hypered...