438 search results - page 5 / 88 » The forest hiding problem |
EOR
2007
14 years 9 months ago
2007
MST
2007
14 years 9 months ago
2007
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
71
Voted
IH
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Security documents (currency, treasury bills, stocks, bonds, birth certificates, etc.) provide an interesting problem space for investigating information hiding. Recent a...