3875 search results - page 553 / 775 » Approximation algorithms for the 0-extension problem |
159
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
179
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
183
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
222
click to vote
SIROCCO
1997
15 years 8 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
168
click to vote
MONET
2006
15 years 6 months ago
2006
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...