453 search results - page 4 / 91 » On Approximation of Bookmark Assignments |
SODA
2000
ACM
15 years 29 days ago
2000
ACM
124
Voted
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
101
click to vote
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— The problem Min-Power k-Connectivity seeks a power assignment to the nodes in a given wireless ad hoc network such that the produced network topology is k-connected and the tot...
ORL
2006
14 years 11 months ago
2006
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
81
Voted
IEEESCC
2009
IEEE
15 years 6 months ago
2009
IEEE
Finding relevant files in a personal file system continues to be a challenge. It is still easier to find stuff on the Web with its exponential growth than in one’s personal ...