On approximating tree spanners that are breadth first search trees

被引：3

作者：

Papoutsakis, Ioannis ^{[1
]}

机构：

[1] Kastelli Pediados, Iraklion 70006, Crete, Greece

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2016年 / 82卷 / 05期

关键词：

Tree spanner; Low stretch; Hardness of approximation; Spanning tree; Distance; COMPLEXITY; GRAPHS;

D O I：

10.1016/j.jcss.2016.02.008

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

There are known efficient algorithms that approximate the minimum t for which a graph admits a tree t-spanner with ratio O(log n). Unless there is an algorithm that decides 3-SAT in quasi-polynomial time, it is impossible to approximate efficiently the minimum t for which a graph admits a tree t-spanner that is a breadth first search tree starting from a given vertex with ratio almost o(log n). (C) 2016 Elsevier Inc. All rights reserved.

引用

页码：817 / 825

页数：9

共 50 条

[1] Navigational Evaluation of Breadth First Search Spanning Trees
Helic, Denis
Strohmaier, Markus
Wojcik, Weronika
2013 36TH INTERNATIONAL CONVENTION ON INFORMATION AND COMMUNICATION TECHNOLOGY, ELECTRONICS AND MICROELECTRONICS (MIPRO), 2013, : 998 - 1003
[2] Breadth First Search Tree and x-y Shortest Paths Tree
Milkova, Eva
RECENT ADVANCES IN CIRCUITS, SYSTEMS AND SIGNALS, 2010, : 15 - 15
[3] NEW DISTRIBUTED ALGORITHM TO FIND BREADTH FIRST SEARCH TREES.
Awerbuch, Baruch
Gallager, Robert G.
1600, (IT-33):
[4] Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
Dragan, Feodor F.
Abu-Ata, Muad
SOFSEM 2013: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2013, 7741 : 194 - 206
[5] Additive tree O (p log n)-spanners from tree breadth p
Bendele, Oliver
Rautenbach, Dieter
THEORETICAL COMPUTER SCIENCE, 2022, 914 : 39 - 46
[6] Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
Dragan, Feodor F.
Abu-Ata, Muad
THEORETICAL COMPUTER SCIENCE, 2014, 547 : 1 - 17
[7] A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs
Antalan, John Rafael M.
Campena, Francis Joseph H.
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2021, 14 (01): : 248 - 264
[8] On the Hardness of Approximating Spanners
G. Kortsarz
Algorithmica, 2001, 30 : 432 - 450
[9] On the hardness of approximating spanners
Kortsarz, G
ALGORITHMICA, 2001, 30 (03) : 432 - 450
[10] A method of characterizing network topology based on the breadth-first search tree
Zhou, Bin
He, Zhe
Wang, Nianxin
Wang, Bing-Hong
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 450 : 682 - 686

← 1 2 3 4 5 →