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

Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem

  • Published:2018-10-26 Issue:2 Volume:73 Page:206-233
  • ISSN:0028-3045
  • Container-title:Networks
  • language:en
  • Short-container-title:NETWORKS

Author:

Rehfeldt Daniel12ORCID,Koch Thorsten12,Maher Stephen J.13

Affiliation:

1. Zuse Institute Berlin; Berlin Germany

2. Department of Mathematics; TU Berlin; Berlin Germany

3. Department of Management Science; Lancaster University; Lancaster UK

Funder

Bundesministerium für Wirtschaft und Energie

Deutsche Forschungsgemeinschaft

European Cooperation in Science and Technology

German Federal Ministry of Education and Research

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference37 articles.

1. http://dimacs11.zib.de/

2. T. Achterberg 2007

3. 2014 http://dimacs11.zib.de/workshop.html

4. The Maximum Weight Connected Subgraph Problem

5. An integer linear programming approach for finding deregulated subgraphs in regulatory networks;Backes;Nucleic Acids Res.,2011

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

1. An efficient solver for large-scale onshore wind farm siting including cable routing;European Journal of Operational Research;2024-09

2. New formulations for two location problems with interconnected facilities;European Journal of Operational Research;2024-04

3. Vertex covering with capacitated trees;Networks;2022-11-10

4. Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties;Proceedings of the 2022 International Conference on Management of Data;2022-06-10

5. Recent Advances in Practical Data Reduction;Lecture Notes in Computer Science;2022
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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