28 search results - page 1 / 6 » Lower bounds for the relative greedy algorithm for approxima... |
NETWORKS
2006
13 years 4 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
CCCG
2007
13 years 6 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 ...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
WG
2001
Springer
13 years 9 months ago
2001
Springer
SODA
2008
ACM
13 years 6 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...