909 search results - page 68 / 182 » On the approximability of some network design problems |
182
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
125
click to vote
SIGECOM
2009
ACM
16 years 21 days ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
153
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
123
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...
135
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
— Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). In this work, we study the problem of desig...