Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling 论文

2007引用 216
DOI
Complexity and Algorithms in GraphsOptimization and Search ProblemsAdvanced Graph Theory Research
Optimization and Search ProblemsAdvanced Graph Theory ResearchComplexity and Algorithms in Graphs
相关技术:Optimization and Search ProblemsComplexity and Algorithms in Graphs
关系图谱

Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling · 相关事件

暂无数据