720 search results - page 17 / 144 » Linear k-arboricities on trees |
SIS
2004
13 years 10 months ago
2004
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...
COMPSAC
2006
IEEE
14 years 10 days ago
2006
IEEE
We propose Tree Hash to reduce bucket overflow, which is one of the inherent problems in dynamic hash techniques. In this investigation, we dicuss how to improve efficien cy of Tre...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
JDA
2006
13 years 8 months ago
2006
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
ORL
2008
13 years 8 months ago
2008
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...