Sciweavers

453 search results - page 4 / 91
» On Approximation of Bookmark Assignments
Sort
View
SODA
2000
ACM
137views Algorithms» more  SODA 2000»
13 years 8 months ago
Approximating the maximum quadratic assignment problem
Esther M. Arkin, Refael Hassin
INFOCOM
2012
IEEE
11 years 10 months ago
Maximizing capacity with power control under physical interference model in duplex mode
—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...
Peng-Jun Wan, Dechang Chen, Guojun Dai, Zhu Wang, ...
INFOCOM
2005
IEEE
14 years 1 months ago
Power assignment for k-connectivity in wireless ad hoc networks
— 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...
Xiaohua Jia, Dongsoo Kim, Sam Makki, Peng-Jun Wan,...
ORL
2006
114views more  ORL 2006»
13 years 7 months ago
A (1-1/e)-approximation algorithm for the generalized assignment problem
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 ...
Zeev Nutov, Israel Beniaminy, Raphael Yuster
IEEESCC
2009
IEEE
14 years 2 months ago
JabberWocky: Crowd-Sourcing Metadata for Files
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 ...
Varun Bhagwan, Carlos Maltzahn