Cart (Loading....) | Create Account
Close category search window
 

Approximation Strategy Based on Data Merging for Static Data Management in Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
DongMei Xing ; Shanghai Key Lab. of Intell. Inf. Process, Fudan Univ., Shanghai, China ; Hong Zhu

We studied static data management problem based on data merging in general networks with object to minimize the total costs. By using greedy and LP-dual method, an initial placement is acquired. Given network G=(V, E) and data set X, we can achieve a constant ratio approximation algorithm.The key of our method is to construct some clusters based on hierarchical structure for requests. In order to get the initial placement, we preciously discuss an approximation strategy for a variance of facility location with service installation cost.

Published in:

INC, IMS and IDC, 2009. NCM '09. Fifth International Joint Conference on

Date of Conference:

25-27 Aug. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.