Sciweavers

6 search results - page 1 / 2
» Steiner centers and Steiner medians of graphs
Sort
View
DM
2008
46views more  DM 2008»
13 years 5 months ago
Steiner centers and Steiner medians of graphs
Hong-Gwa Yeh, Chun-Ying Chiang, Sheng-Hueng Peng
HM
2007
Springer
137views Optimization» more  HM 2007»
13 years 11 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
INFOCOM
2008
IEEE
13 years 11 months ago
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
Animashree Anandkumar, Lang Tong, Ananthram Swami,...
INFOCOM
2009
IEEE
13 years 12 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—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 ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...
CPAIOR
2008
Springer
13 years 7 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...