Author:
Bläser Markus,Siebert Bodo
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. M. Ajtai. Recursive construction for 3-regular expanders. Combinatorica, 14(4):379–416, 1994.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer, 1999.
3. G. Cornuéjols and W. Pulleyblank. A matching problem with side constraints. Discrete Math., 29:135–159, 1980.
4. J. Edmonds. Paths, trees, and flowers. Canad. J. Math., 17:449–467, 1965.
5. L. Engebretsen and M. Karpinski. Approximation hardness of TSP with bounded metrics. Technical Report 00-089, Electronic Colloquium on Comput. Complexity (ECCC), 2000.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献