791 search results - page 100 / 159 » Approximating the Maximum Sharing Problem |
169
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
156
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
173
click to vote
TCC
2009
Springer
16 years 6 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...
166
click to vote
COMBINATORICA
2007
15 years 5 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
163
click to vote
INFOCOM
2007
IEEE
16 years 14 days ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...