3096 search results - page 279 / 620 » The Generalized FITC Approximation |
184
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
218
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
205
click to vote
COCOON
2005
Springer
16 years 24 days ago
2005
Springer
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
178
click to vote
LATIN
2010
Springer
16 years 11 days ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
238
click to vote
SWAT
2010
Springer
16 years 9 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...