Level-treewidth property, exact algorithms and approximation schemes
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[2] Joan Feigenbaum,et al. Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions , 1993, STOC.
[3] Egon Wanke,et al. The Complexity of Connectivity Problems on Context-Free Graph Languages , 1994, J. Comput. Syst. Sci..
[4] Rajeev Motwani,et al. On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[5] Edith Cohen,et al. Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs , 1989, STOC '89.
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Shang-Hua Teng,et al. Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[8] Rajeev Motwani,et al. Towards a syntactic characterization of PTAS , 1996, STOC '96.
[9] R. Ravi,et al. Bicriteria Network Design Problems , 1998, J. Algorithms.
[10] Harry B. Hunt,et al. An Algebraic Model for Combinatorial Problems , 1996, SIAM J. Comput..
[11] Orlin James B. .. The complexity of dynamic/periodic languages and optimization problems , 1985 .
[12] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.