Augmenting Graphs to Minimize the Diameter

Frati Fabrizio; Gaspers Serge; Gudmundsson Joachim; Mathieson Luke

首页> 外文期刊>Algorithmica >Augmenting Graphs to Minimize the Diameter

【24h】

Augmenting Graphs to Minimize the Diameter

机译：扩展图形以最小化直径

获取原文

获取原文并翻译 | 示例

开具论文收录证明 >>

页面导航

摘要
著录项
引文网络
相似文献
相关主题

摘要

We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT -approximation algorithm for the problem.

机译：我们研究了通过插入有限制的总成本边同时最小化扩展图直径的方法来扩展加权图的问题。我们的主要结果是针对该问题的FPT近似算法。

著录项

来源
《Algorithmica》 |2015年第4期|995-1010|共16页
作者
Frati Fabrizio; Gaspers Serge; Gudmundsson Joachim; Mathieson Luke;
展开▼
作者单位

Univ Sydney, Sydney, NSW 2006, Australia;

NICTA, Sydney, NSW, Australia|Univ New S Wales, Sydney, NSW, Australia;

NICTA, Sydney, NSW, Australia|Univ Sydney, Sydney, NSW 2006, Australia;

Macquarie Univ, Sydney, NSW 2109, Australia;

展开▼
收录信息美国《科学引文索引》(SCI);美国《工程索引》(EI);
原文格式 PDF
正文语种 eng
中图分类
关键词
Graph Algorithms; Approximation algorithms; Parametrized complexity;

机译：图算法;近似算法;参数化复杂度;

相似文献

外文文献
中文文献
专利

1. Minimizing the continuous diameter when augmenting a geometric tree with a shortcut [J] . Computational geometry: Theory and applications . 2020,第期

机译：使用快捷方式增强几何树时最小化连续直径
2. Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts [J] . Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, LIPIcs : Leibniz International Proceedings in Informatics . 2016,第4期

机译：使用捷径增强路径和循环时最小化连续直径
3. Selecting optimal pipeline diameters for a district heating network comprising branches and rings, using graph theory and cost minimization [J] . Jakub Murat, Adam Smyk, Rafal Marcin Laskowski Bulletin of the Institute of Heat Engineering . 2018,第1期

机译：使用图论和成本最小化为包含分支和环形的区域供热网络选择最佳管道直径
4. Augmenting Graphs to Minimize the Diameter [C] . Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, International symposium on algorithms and computation . 2013

机译：扩展图形以最小化直径
5. Quick Trips: On the Oriented Diameter of Graphs [D] . Cochran, Garner Paul. 2018

机译：快速旅行：在图的定向直径上
6. Understanding the Radial Force of Stroke Thrombectomy Devices to Minimize Vessel Wall Injury: Mechanical Bench Testing of the Radial Force Generated by a Novel Braided Thrombectomy Assist Device Compared to Laser-Cut Stent Retrievers in Simulated MCA Vessel Diameters [O] . Jeffrey M. Katz, Abdullah M. Hakoun, Amir R. Dehdashti, 2020

机译：理解中风血栓切除术装置的径向力以最小化血管壁损伤：与模拟MCA血管直径的激光切割支架检索相比新型编织血液切除术辅助装置产生的径向力的机械台阶测试
7. Augmenting Graphs to Minimize the Diameter [O] . Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, 2016

机译：增加图形以最小化直径
8. Approximation Algorithms for Clustering to Minimize the Sum of Diameters [R] . Kopp, S., Mortveit, H. S., Reidys, S. M. 2000

机译：用于最小化直径和的聚类的近似算法

Augmenting Graphs to Minimize the Diameter

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅