PSPACE困难的分层周期问题的近似算法
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
摘要:
我们研究了文献中的基本图形和逻辑问题的有效近似性时,实例指定的层次结构,如在\cite{Le89}或指定的一维有限窄周期规范,如在\cite{Wa93}。我们表明,对于大多数的问题$Π$考虑指定时使用{ \bf k级限制}层次规范或$k$ -窄周期规范,以下持有:\item让$ρ$是任何性能保证的多项式时间近似算法$Π$,当实例指定使用标准规范。然后是$\forall ε> 0$,$ Π$具有多项式时间近似算法,具有性能保证$(1 + ε) ρ$。\item $Π$在受限于平面实例时具有多项式时间近似方案。\end{romannum}这些是第一个多项式时间近似计划PSPACE硬层次或定期指定的问题。由于考虑的几个问题是PSPACE硬的,我们的研究结果提供了自然PSPACE硬优化问题,有多项式时间近似方案的第一个例子。这回答了一个开放的问题在Condon等。\cite{CF+93} .
英文摘要:
We study the efficient approximability of basic graph and logic problems in the literature when instances are specified hierarchically as in \cite{Le89} or are specified by 1-dimensional finite narrow periodic specifications as in \cite{Wa93}. We show that, for most of the problems $Π$ considered when specified using {\bf k-level-restricted} hierarchical specifications or $k$-narrow periodic specifications the following holds: \item Let $ρ$ be any performance guarantee of a polynomial time approximation algorithm for $Π$, when instances are specified using standard specifications. Then $\forall ε> 0$, $ Π$ has a polynomial time approximation algorithm with performance guarantee $(1 + ε) ρ$. \item $Π$ has a polynomial time approximation scheme when restricted to planar instances. \end{romannum} These are the first polynomial time approximation schemes for PSPACE-hard hierarchically or periodically specified problems. Since several of the problems considered are PSPACE-hard, our results provide the first examples of natural PSPACE-hard optimization problems that have polynomial time approximation schemes. This answers an open question in Condon et. al. \cite{CF+93}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。