Strong bounds on the approximability of two Pspace-hard problems in propositional planning

被引：0
|
作者：
Peter Jonsson
机构：
[1] Linköping Universitet,Department of Computer and Information Science
来源：
Annals of Mathematics and Artificial Intelligence | 1999年 / 26卷
关键词：
Feasible Solution; Polynomial Time; Minimal Solution; Optimization Version; State Transition Graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The computational complexity of planning with Strips-style operators has received a considerable amount of interest in the literature. However, the approximability of such problems has only received minute attention. We study two Pspace-hard optimization versions of propositional planning and provide tight upper and lower bounds on their approximability.
引用
收藏
页码：133 / 147
页数：14
相关论文
共 4 条
1