628 search results - page 55 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
142
click to vote
NETWORKS
2010
15 years 1 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
131
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
152
click to vote
ALGORITHMICA
1998
15 years 2 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
116
click to vote
NIPS
2004
15 years 4 months ago
2004
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...