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

2001引用 216
DOI
Complexity and Algorithms in GraphsMachine Learning and AlgorithmsAdvanced Graph Theory Research
人工智能Machine Learning and AlgorithmsAdvanced Graph Theory ResearchComplexity and Algorithms in Graphs
相关技术:Complexity and Algorithms in GraphsMachine Learning and Algorithms
关系图谱

1

作者

2

相关技术

0

相关事件

0

相关文章

摘要

par>We prove some non-approximability results for restrictions of basic combinatorial optimization problems to instances of bounded “degree&r dquo;or bounded “width.” Specifically:

作者查看全部 (1)

L

Luca Trevisan

相关技术查看全部 (2)

Complexity and Algorithms in GraphsMachine Learning and Algorithms

相关事件

暂无数据

相关文章

暂无数据