33 search results - page 5 / 7 » Polynomial-Time Approximation Schemes for Subset-Connectivit... |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
100
click to vote
STOC
2007
ACM
15 years 10 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
115
click to vote
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
116
click to vote
MOBICOM
2006
ACM
15 years 3 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...