4894 search results - page 667 / 979 » The Guarding Problem - Complexity and Approximation |
143
Voted
TCC
2009
Springer
16 years 4 months ago
2009
Springer
We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is fair when executed with many rational parties together with a s...
122
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
116
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
115
Voted
STOC
2004
ACM
16 years 4 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
130
Voted
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...