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

Improving Minimum Cost Spanning Trees by Upgrading Nodes

  • Published:1999-10 Issue:1 Volume:33 Page:92-111
  • ISSN:0196-6774
  • Container-title:Journal of Algorithms
  • language:en
  • Short-container-title:Journal of Algorithms

Author:

Krumke S.O,Marathe M.V,Noltemeier H,Ravi R,Ravi S.S,Sundaram R,Wirth H.-C

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference14 articles.

1. Network flows;Ahuja,1993

2. Improving the location of minisum facilities through network modification;Berman;Ann. Oper. Res.,1992

3. U. Feige, A threshold of lnn for approximating set cover, inProceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC'96), 1996, pp. 314–318.

4. Increasing the weight of minimum spanning trees;Frederickson,1996

5. Computers and Intractability (A Guide to the Theory of NP-Completeness);Garey,1979

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

1. Uncapacitated single-allocation hub median location with edge upgrading: Models and exact solution algorithms;Transportation Research Part B: Methodological;2024-09

2. Upgrading nodes in tree-shaped hub location;Computers & Operations Research;2019-02

3. Lagrangian and branch-and-cut approaches for upgrading spanning tree problems;Computers & Operations Research;2017-07

4. Optimal Upgrading Schemes for Effective Shortest Paths in Networks;Integration of AI and OR Techniques in Constraint Programming;2016

5. The Capacity Expansion Path Problem in Networks;Journal of Applied Mathematics;2013
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3