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 条

[21] A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees
Datta, Ajoy K.
Larmore, Lawrence L.
Masuzawa, Toshimitsu
PRINCIPLES OF DISTRIBUTED SYSTEMS, OPODIS 2014, 2014, 8878 : 293 - 306
[22] Breadth first search on massive graphs
Ajwani, Deepak
Dementiev, Roman
Meyer, Ulrich
Osipov, Vitaly
SHORTEST PATH PROBLEM, 2009, 74 : 291 - +
[23] Lexicographic breadth first search - A survey
Corneil, DG
GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 1 - 19
[24] TREE SPANNERS
CAI, LZ
CORNEIL, DG
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1995, 8 (03) : 359 - 387
[25] Parallelization of enumerating tree-like chemical compounds by breadth-first search order
Hayashida, Morihiro
Jindalertudomdee, Jira
Zhao, Yang
Akutsu, Tatsuya
BMC MEDICAL GENOMICS, 2015, 8
[26] Parallelization of enumerating tree-like chemical compounds by breadth-first search order
Morihiro Hayashida
Jira Jindalertudomdee
Yang Zhao
Tatsuya Akutsu
BMC Medical Genomics, 8
[27] Reduced-Complexity MIMO Detection via a Slicing Breadth-First Tree Search
Suh, Sangwook
Barry, John R.
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (03) : 1782 - 1790
[28] BFSDPOP: DPOP Based on Breadth First Search Pseudo-Tree for Distributed Constraint Optimization
He, Zhen
Chen, Zi-yu
COMPUTER SCIENCE AND TECHNOLOGY (CST2016), 2017, : 809 - 816
[29] Deep Learning Aided Low Complex Breadth-First Tree Search for MIMO Detection
Liao, Jieyu
Zhao, Junhui
Gao, Feifei
Li, Geoffrey Ye
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2024, 23 (06) : 6266 - 6278
[30] Parallel Breadth First Search on GPU Clusters
Fu, Zhisong
Dasari, Harish Kumar
Bebee, Bradley
Berzins, Martin
Thompson, Bryan
2014 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2014, : 110 - 118

← 1 2 3 4 5 →