双准则网络设计问题
Bicriteria Network Design Problems
摘要:
我们研究了一类一般的双准则网络设计问题。这类中的一个一般问题如下:给定一个无向图和两个最小化目标(在不同的成本函数下),在第一个目标上指定预算,找到一个<子图\from,一个给定的子图类,它最小化第二个目标。我们考虑三个不同的标准-总的边缘成本,直径和网络的最大程度。在这里,我们提出了第一多项式时间的近似算法的一个大类的双准则网络设计问题的上述标准。给出了以下一般类型的结果。首先,我们开发了一个框架的双准则问题及其近似。其次,当两个标准相同时(注意,成本函数仍然不同),我们提出了一种“黑盒”参数搜索技术。该黑盒将用于单一准则情形的(近似)算法作为输入,并生成用于双准则情形的近似算法,其中在性能保证中仅具有常数因子损失。第三,当两个标准是直径和总的边缘成本,我们使用基于聚类的方法来设计一个近似算法--解决方案的输出违反这两个标准的对数因子。最后,对于树宽有界图类,我们利用动态规划给出了一些双准则问题的伪多项式时间算法。我们展示了如何将这些伪多项式时间算法转换为完全多项式时间近似计划使用缩放技术。
英文摘要:
We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a <subgraph \from a given subgraph-class that minimizes the second objective subject to the budget on the first. We consider three different criteria - the total edge cost, the diameter and the maximum degree of the network. Here, we present the first polynomial-time approximation algorithms for a large class of bicriteria network design problems for the above mentioned criteria. The following general types of results are presented. First, we develop a framework for bicriteria problems and their approximations. Second, when the two criteria are the same %(note that the cost functions continue to be different) we present a ``black box'' parametric search technique. This black box takes in as input an (approximation) algorithm for the unicriterion situation and generates an approximation algorithm for the bicriteria case with only a constant factor loss in the performance guarantee. Third, when the two criteria are the diameter and the total edge costs we use a cluster-based approach to devise a approximation algorithms --- the solutions output violate both the criteria by a logarithmic factor. Finally, for the class of treewidth-bounded graphs, we provide pseudopolynomial-time algorithms for a number of bicriteria problems using dynamic programming. We show how these pseudopolynomial-time algorithms can be converted to fully polynomial-time approximation schemes using a scaling technique.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。