Sciweavers

909 search results - page 33 / 182
» On the approximability of some network design problems
Sort
View
NDSS
2003
IEEE
15 years 6 months ago
Traps and Pitfalls: Practical Problems in System Call Interposition Based Security Tools
System call interposition is a powerful method for regulating and monitoring application behavior. In recent years, a wide variety of security tools have been developed that use t...
Tal Garfinkel
NETWORKS
2010
14 years 12 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
ICDCS
2010
IEEE
15 years 5 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 3 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
113
Voted
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 11 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...