位置：成果数据库 > 期刊 > 期刊详情页
Efficient algorithms for the prize collecting Steiner tree problems with interval data
  • 时间：0
  • 相关项目：装填与覆盖的对偶整数性理论及其应用
同期刊论文项目
装填与覆盖的对偶整数性理论及其应用
期刊论文 13 著作 3
同项目期刊论文
Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks,Frontier
Approximating the Chromatic Index of Multigraphs
Approximation algorithm for minimal convergecast time problem in wireless sensor networks
A Unified Approach to Box-Mengerian Hypergraphs
Bonds with Parity Constraints
Approximate Min-Max Relations on Plane Graphs, J. of Combinatorial Optimization, to appear.
Deterministic risk control for cost-effective network connections
The price of atomic selfish ring routing
Improved algorithm for broadcast scheduling of minimal latency in wireless Ad hoc networks
The conditional diagnosability of shuffle-cubes
Roman domination and its variants in unit disk graphs, Discrete Mathematics
Reducing the maximum latency of selfish ring routing via bilateral cooperations