30 search results - page 4 / 6 » Approximating Fault-Tolerant Group-Steiner Problems |
HICSS
2008
IEEE
13 years 10 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...