2322 search results - page 57 / 465 » On a game in directed graphs |
160
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
172
click to vote
CAAN
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
285
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
This tutorial presents an overview of the data management issues faced by computer games today. While many games do not use databases directly, they still have to process large am...
163
click to vote
CORR
2011
Springer
15 years 19 days ago
2011
Springer
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
242
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...