628 search results - page 44 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
155
click to vote
CISS
2007
IEEE
15 years 7 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
166
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
154
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
147
click to vote
COCOA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
140
click to vote
PVLDB
2010
15 years 1 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...