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 条

[31] A compressed breadth-first search for satisfiability
Motter, DRB
Markov, IL
ALGORITHM ENGINEERING AND EXPERIMENTS, 2002, 2409 : 29 - 42
[32] Parallel Distributed Breadth First Search on GPU
Ueno, Koji
Suzumura, Toyotaro
2013 20TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING (HIPC), 2013, : 314 - 323
[33] Efficient Breadth-First Reduct Search
Boonjing, Veera
Chanvarasuth, Pisit
MATHEMATICS, 2020, 8 (05)
[34] A Breadth-First Search Algorithm for Mining Generalized Frequent Itemsets Based on Set Enumeration Tree
Mao, Yu Xing
Shi, Bai Le
CSA 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND ITS APPLICATIONS, PROCEEDINGS, 2008, : 62 - 67
[35] An improved DPOP algorithm based on breadth first search pseudo-tree for distributed constraint optimization
Chen, Ziyu
He, Zhen
He, Chen
APPLIED INTELLIGENCE, 2017, 47 (03) : 607 - 623
[36] An improved DPOP algorithm based on breadth first search pseudo-tree for distributed constraint optimization
Ziyu Chen
Zhen He
Chen He
Applied Intelligence, 2017, 47 : 607 - 623
[37] GIS Geoprocessing Services Search Based on Breadth-first Reverse Share Pruning AND/OR Tree Algorithm
Zhang, Shan
Wang, Fengxia
2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014, : 850 - 855
[38] Additive tree spanners
Kratsch, D
Le, HO
Müller, H
Prisner, E
Wagner, D
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 17 (02) : 332 - 340
[39] Measuring the Search Effectiveness of a Breadth-First Crawl
Fetterly, Dennis
Craswell, Nick
Vinay, Vishwa
ADVANCES IN INFORMATION RETRIEVAL, PROCEEDINGS, 2009, 5478 : 388 - +
[40] Direction-optimizing breadth-first search
Beamer, Scott
Asanovic, Krste
Patterson, David
SCIENTIFIC PROGRAMMING, 2013, 21 (3-4) : 137 - 148

← 1 2 3 4 5 →