274 search results - page 2 / 55 » The Polymatroid Steiner Problems |
CCCG
2007
13 years 6 months ago
2007
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
EVOW
2007
Springer
13 years 11 months ago
2007
Springer
The Steiner Tree Problem (STP) in graphs is a well-known
FSTTCS
2003
Springer
13 years 10 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
RECOMB
2012
Springer
11 years 7 months ago
2012
Springer
Signaling networks are essential for cells to control processes such as growth and response to stimuli. Although many “omic” data sources are available to probe signaling pathw...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract--The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have establi...