Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem-Reference-Cited by-同舟云学术

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

Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem

Published:2015-01 Issue: Volume:30 Page:29-44
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Jordán Tibor,Schlotter Ildikó

Funder

Hungarian Scientific Research Fund

Publisher

Elsevier BV

Subject

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

Reference30 articles.

1. Generalized multi-protocol label switching (GMPLS) signalling functional description, 2003, IETF RFC 3471.

2. Generalized multi-protocol label switching (GMPLS) architecture, October 2004, IETF RFC 3945.

3. When trees collide: an approximation algorithm for the generalized Steiner problem on networks;Agrawal;SIAM J. Comput.,1995

4. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987

5. Fourier meets Möbius: fast subset convolution;Björklund,2007

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP