632 search results - page 58 / 127 » On the Approximability of the Steiner Tree Problem |
SAC
2003
ACM
14 years 2 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
WAOA
2004
Springer
14 years 2 months ago
2004
Springer
We provide a new technique to derive group strategyproof mechanisms for the cost-sharing problem. Our technique is simpler and provably more powerful than the existing one based on...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...