570 search results - page 64 / 114 » Approximating Some Network Design Problems with Node Costs |
OL
2011
13 years 3 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
LATIN
2010
Springer
14 years 2 months 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...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
ICDCS
2010
IEEE
14 years 24 days ago
2010
IEEE
—As wireless power charging technology emerges, some basic principles in sensor network design are changed accordingly. Existing sensor node deployment and data routing strategie...
COR
2007
13 years 9 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...