2 search results - page 1 / 1 » Fixed Parameter Polynomial Time Algorithms for Maximum Agree... |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
CORR
2010
Springer
13 years 11 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...