位置：成果数据库 > 期刊 > 期刊详情页
Inapproximability and approximability of minimal tree routing and coloring
  • ISSN号：1570-8667
  • 期刊名称：Journal of Discrete Algorithms
  • 时间：0
  • 页码：341-351
  • 语言：英文
  • 相关项目：网络优化设计中的算法博弈研究
作者： Xiaodong Hu|Xiaohua Jia|Xujin Chen|
同期刊论文项目
网络优化设计中的算法博弈研究
期刊论文 25 会议论文 2
同项目期刊论文
Packing cycles exactly in polynomial time
A unified approach to box-Mengerian hypergraphs
Improved Algorithm for minimum data aggregation time problem in wireless sensor networks
Conditional Diagnosability of Matching Composition Networks Under the PMC Model
Approximation algorithms for soft-capacitated facility location in capacitated network design
The box-TDI system associated with 2-edge connected spanning subgraphs
Cost-effective designs of fault-tolerant access networks in communication systems
A polynomial solvable minimum risk spanning tree problem with interval data
Data gathering schedule for minimal aggregation time in wireless sensor networks
The conditional diagnosability of shuffle-cubes
带区间数据的最小风险斯坦纳树问题
A characterization of box-Mengerian matroid ports
Identifying codes of cycles with odd orders