NP-hardness and fixed-parameter tractability of the minimum spanner problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

NP-hardness and fixed-parameter tractability of the minimum spanner problem

Published:2018-10 Issue: Volume:746 Page:88-97
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Kobayashi Yusuke

Funder

JST

JSPS

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. The 4/3 additive spanner exponent is tight;Abboud;J. ACM,2017

2. Faster algorithms for approximate distance oracles and all-pairs small stretch paths;Baswana,2006

3. NP-completeness results for minimum planar spanners;Brandes,1997

4. NP-completeness of minimum spanner problems;Cai;Discrete Appl. Math.,1994

5. Tree spanners;Cai;SIAM J. Discrete Math.,1995

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial algorithms for sparse spanners on subcubic graphs;Journal of Combinatorial Optimization;2024-08

2. Complexity of the multiobjective minimum weight minimum stretch spanner problem;Mathematical Methods of Operations Research;2024-02-15

3. Improved -hardness results for the minimum t-spanner problem on bounded-degree graphs;Theoretical Computer Science;2023-02

4. Sparsification lower bound for linear spanners in directed graphs;Theoretical Computer Science;2022-01

5. Minimum t-Spanners on Subcubic Graphs;WALCOM: Algorithms and Computation;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP