Sciweavers

1671 search results - page 154 / 335
» On the Covering Steiner Problem
Sort
View
TON
2002
144views more  TON 2002»
15 years 6 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
INFOCOM
2010
IEEE
15 years 5 months ago
Information Quality Aware Routing in Event-Driven Sensor Networks
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
Hwee-Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng ...
COMPGEOM
2006
ACM
16 years 19 days ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
16 years 25 days ago
Optimal antenna placement using a new multi-objective chc algorithm
Radio network design (RND) is a fundamental problem in cellular networks for telecommunications. In these networks, the terrain must be covered by a set of base stations (or anten...
Antonio J. Nebro, Enrique Alba, Guillermo Molina, ...
EOR
2006
61views more  EOR 2006»
15 years 6 months ago
Scheduling trainees at a hospital department using a branch-and-price approach
Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in many hospital departments. We will describe a trainee-scheduling problem encou...
Jeroen Beliën, Erik Demeulemeester