几何网络中数据管理的近似算法

2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop Pub Date : 2008-12-01 DOI:10.1109/KAMW.2008.4810629

Dongmei Xing

{"title":"几何网络中数据管理的近似算法","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":"{\"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}","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

摘要

设计了一种近似的几何网络静态数据管理策略。如果所有参数都给定，则得到一个常数近似比。这里，我们假设链路代价不满足三角不等式，但最大链路代价与最小链路代价之比已知。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Approximation Algorithms for Data management in Geometric Network

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop

自引率

0.00%

发文量