Sciweavers

274 search results - page 3 / 55
» The Polymatroid Steiner Problems
Sort
View
TCC
2007
Springer
89views Cryptology» more  TCC 2007»
13 years 11 months ago
On Secret Sharing Schemes, Matroids and Polymatroids
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...
Jaume Martí-Farré, Carles Padr&oacut...
CCCG
2007
13 years 6 months ago
Terminal Steiner Tree with Bounded Edge Length
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 ...
Zhiyong Lin
CCCG
2008
13 years 6 months ago
The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees
We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We ext...
Mina Razaghpour, Anna Lubiw
COCOA
2009
Springer
13 years 11 months ago
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
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...
Xianyue Li, Xiao-Hua Xu, Feng Zou, Hongwei Du, Pen...