DocumentCode
492217
Title
Approximation Algorithms for Data management in Geometric Network
Author
Xing, DongMei
fYear
2008
fDate
21-22 Dec. 2008
Firstpage
868
Lastpage
872
Abstract
An approximate strategy is designed for the static data management in geometric network. If all parameters is given, a constant approximation ratio is achieved. Here, we suppose that the link cost don´t satisfy triangle inequality, but the ratio of the maximum link cost to the minimum value is known.
Keywords
approximation theory; data handling; approximation algorithms; data management; geometric network; Algorithm design and analysis; Approximation algorithms; Computer network management; Computer science; Costs; Frequency; Intelligent networks; Laboratories; Mathematics; Technology management; UFL; approximation ratio; geometric distance; static data management;
fLanguage
English
Publisher
ieee
Conference_Titel
Knowledge Acquisition and Modeling Workshop, 2008. KAM Workshop 2008. IEEE International Symposium on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-3530-2
Electronic_ISBN
978-1-4244-3531-9
Type
conf
DOI
10.1109/KAMW.2008.4810629
Filename
4810629
Link To Document