Author:
Chen Zhi-Zhong,Harada Youta,Guo Fei,Wang Lusheng
Funder
City University of Hong Kong
Research Grants Council, University Grants Committee
National Natural Science Foundation of China
Ministry of Education, Culture, Sports, Science and Technology
Subject
General Computer Science,Theoretical Computer Science
Reference10 articles.
1. Complexity and polynomial-time approximation algorithms around the scaffolding problem;Chateau,2014
2. A complexity and approximation framework for the maximization scaffolding problem;Chateau;Theoret. Comput. Sci.,2015
3. Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs;Gabow,1973
4. An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems;Gabow,1983
5. An approximation algorithm for the maximum traveling salesman problem;Hassin;Inform. Process. Lett.,1998
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献