350 search results - page 21 / 70 » Approximation Algorithms for Unique Games |
116
click to vote
CJ
2010
15 years 3 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
142
click to vote
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...
147
click to vote
AAAI
2007
15 years 5 months ago
2007
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
136
click to vote
ALENEX
2009
15 years 4 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
132
click to vote
ESA
2004
Springer
15 years 8 months ago
2004
Springer
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...