Non-approximability results for optimization problems on bounded degree instances 论文

2001引用 216

Complexity and Algorithms in GraphsMachine Learning and AlgorithmsAdvanced Graph Theory Research

人工智能 Machine Learning and Algorithms Advanced Graph Theory Research Complexity and Algorithms in Graphs

相关技术:Complexity and Algorithms in Graphs Machine Learning and Algorithms

Non-approximability results for optimization problems on bounded degree instances · 相关文章

暂无数据