Sciweavers

11371 search results - page 111 / 2275
» The network inhibition problem
Sort
View
ORL
2006
103views more  ORL 2006»
15 years 6 months ago
Reduction tests for the prize-collecting Steiner problem
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
Eduardo Uchoa
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
15 years 6 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
WCNC
2008
IEEE
16 years 24 days ago
Connectivity-Aware Network Maintenance via Relays Deployment
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu
TPDS
2008
93views more  TPDS 2008»
15 years 6 months ago
The Server Reassignment Problem for Load Balancing in Structured P2P Systems
Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. For these systems to be effective, lo...
Chyouhwa Chen, Kun-Cheng Tsai
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 10 months ago
New On-Line Algorithms for the Page Replication Problem
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
Susanne Albers, Hisashi Koga