斯坦纳树的快速再优化

2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI:10.1109/IADCC.2010.5423050

Subhash Panwar, Suneeta Agarwaal

{"title":"斯坦纳树的快速再优化","authors":"Subhash Panwar, Suneeta Agarwaal","doi":"10.1109/IADCC.2010.5423050","DOIUrl":null,"url":null,"abstract":"In this paper, we discuss the problem of reoptimization of Steiner tree. We are given an instance of Graph and also an optimal Steiner tree of it. If some changes occur later on in the given graph, a new optimal Steiner tree is to be determined. This process is known as re optimization. We consider two cases of change: one is addition of a new edge and second is, Deletion of an existing edge from the given graph. For both the cases, we provide approximation algorithms with corresponding approximation ratio equal to (1+δ) where 0≪δ≪1.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"5 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast reoptimization of Steiner trees\",\"authors\":\"Subhash Panwar, Suneeta Agarwaal\",\"doi\":\"10.1109/IADCC.2010.5423050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we discuss the problem of reoptimization of Steiner tree. We are given an instance of Graph and also an optimal Steiner tree of it. If some changes occur later on in the given graph, a new optimal Steiner tree is to be determined. This process is known as re optimization. We consider two cases of change: one is addition of a new edge and second is, Deletion of an existing edge from the given graph. For both the cases, we provide approximation algorithms with corresponding approximation ratio equal to (1+δ) where 0≪δ≪1.\",\"PeriodicalId\":249763,\"journal\":{\"name\":\"2010 IEEE 2nd International Advance Computing Conference (IACC)\",\"volume\":\"5 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 2nd International Advance Computing Conference (IACC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IADCC.2010.5423050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 2nd International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IADCC.2010.5423050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文讨论了斯坦纳树的再优化问题。给出了图的一个实例及其最优Steiner树。如果在给定的图中稍后发生了一些变化，则需要确定一个新的最优Steiner树。这个过程被称为再优化。我们考虑两种变化情况:一种是增加一条新边，另一种是从给定图中删除一条现有边。对于这两种情况，我们都提供了近似算法，其近似比为(1+δ)，其中0≪δ≪1。

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

查看原文本刊更多论文

Fast reoptimization of Steiner trees

In this paper, we discuss the problem of reoptimization of Steiner tree. We are given an instance of Graph and also an optimal Steiner tree of it. If some changes occur later on in the given graph, a new optimal Steiner tree is to be determined. This process is known as re optimization. We consider two cases of change: one is addition of a new edge and second is, Deletion of an existing edge from the given graph. For both the cases, we provide approximation algorithms with corresponding approximation ratio equal to (1+δ) where 0≪δ≪1.

求助全文

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

来源期刊

2010 IEEE 2nd International Advance Computing Conference (IACC)

自引率

0.00%

发文量