{"title":"Approximation Algorithms for Data management in Geometric Network","authors":"Dongmei Xing","doi":"10.1109/KAMW.2008.4810629","DOIUrl":null,"url":null,"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.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"178 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KAMW.2008.4810629","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
