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 条

[41] Direction-Optimizing Breadth-First Search
Beamer, Scott
Asanovic, Krste
Patterson, David
2012 INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS (SC), 2012,
[42] The Communication Analysis of Implementation in Breadth First Search Algorithm
Sun, YiChun
Yi, XiaoDong
Liu, HengZhu
2016 IEEE INTERNATIONAL CONFERENCE ON INTERNET OF THINGS (ITHINGS) AND IEEE GREEN COMPUTING AND COMMUNICATIONS (GREENCOM) AND IEEE CYBER, PHYSICAL AND SOCIAL COMPUTING (CPSCOM) AND IEEE SMART DATA (SMARTDATA), 2016, : 754 - 759
[43] Efficient distributed breadth-first search algorithm
Makki, SAM
COMPUTER COMMUNICATIONS, 1996, 19 (08) : 628 - 636
[44] A parallel algorithm for the stack breadth-first search
Nakashima, T
Fujiwara, A
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2002, E85D (12) : 1955 - 1958
[45] Ordered and Unordered Algorithms for Parallel Breadth First Search
Hassaan, M. Amber
Burtscher, Martin
Pingali, Keshav
PACT 2010: PROCEEDINGS OF THE NINETEENTH INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, 2010, : 539 - 540
[46] iBFS: Concurrent Breadth-First Search on GPUs
Liu, Hang
Huang, H. Howie
Hu, Yang
SIGMOD'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2016, : 403 - 416
[47] Efficient breadth-first search on the Cell/BE processor
Scarpazza, Daniele Paolo
Villa, Oreste
Petrini, Fabrizio
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, 19 (10) : 1381 - 1395
[48] Extreme Scale Breadth-First Search on Supercomputers
Ueno, Koji
Suzumura, Toyotaro
Maruyama, Naova
Fujisawa, Katsuki
Matsuoka, Satoshi
2016 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2016, : 1040 - 1047
[49] Incorporating Breadth First Search for Indexing MathML Objects
Hashimoto, Hideki
Hijikata, Yoshinori
Nishida, Shogo
2008 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC), VOLS 1-6, 2008, : 3518 - 3522
[50] Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees
Handke, D
DISCRETE APPLIED MATHEMATICS, 2001, 108 (1-2) : 105 - 127

← 1 2 3 4 5 →