The non-approximability of bicriteria network design problems-Reference-Cited by-同舟云学术

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

The non-approximability of bicriteria network design problems

Published:2003-06 Issue:3-4 Volume:1 Page:339-355
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Bálint Vojtech

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference21 articles.

1. Computational methods for the diameter restricted minimum weight spanning tree problem;Achuthan;Austral. J. Combin.,1994

2. Cost-sensitive analysis of communication protocols;Awerbuch,1990

3. O jistém problému minimálním;Borůvka;Práce Moravské Přír. Spol. (Brno),1926

4. NP-completeness results for minimum planar spanners;Brandes;Discrete Math. Theoret. Comput. Sci.,1998

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

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

1. Exact approaches for the Minimum Subgraph Diameter Problem;Computers & Operations Research;2023-02

2. The density maximization problem in graphs;Journal of Combinatorial Optimization;2012-03-07

3. The Density Maximization Problem in Graphs;Lecture Notes in Computer Science;2011

4. Multiobjective Genetic Algorithm for Bicriteria Network Design Problems;Studies in Computational Intelligence

5. Basic Network Models;Network Models and Optimization

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP