90 search results - page 17 / 18 » Approximation algorithms for partially covering with edges |
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. Service-specific probes ar...
OPODIS
2004
13 years 6 months ago
2004
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...