102 search results - page 21 / 21 » Better Algorithms and Bounds for Directed Maximum Leaf Probl... |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...