Sciweavers

367 search results - page 1 / 74
» Set connectivity problems in undirected graphs and the direc...
Sort
View
SODA
2008
ACM
73views Algorithms» more  SODA 2008»
13 years 10 months ago
Set connectivity problems in undirected graphs and the directed Steiner network problem
Chandra Chekuri, Guy Even, Anupam Gupta, Danny Seg...
JCT
2008
120views more  JCT 2008»
13 years 9 months ago
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
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...
Tamás Király, Lap Chi Lau
COCOA
2008
Springer
13 years 11 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
13 years 9 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
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...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
FOCS
2006
IEEE
14 years 3 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
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...
Tamás Király, Lap Chi Lau