509 search results - page 79 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
ICCD
2003
IEEE
14 years 4 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
OPODIS
2004
13 years 8 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...