2137 search results - page 329 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
164
click to vote
SAGT
2009
Springer
15 years 11 months ago
2009
Springer
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
158
click to vote
ALT
2010
Springer
15 years 6 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 ...
138
click to vote
MONET
2006
15 years 4 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...
119
click to vote
ESA
2007
Springer
15 years 11 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
152
Voted
COLT
2003
Springer
15 years 10 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...