Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Bateni, M., Hajiaghayi, M., Klein, P., Mathieu, C.: A polynomial-time approximation scheme for planar multiway cut. In: 23th SODA (2012)
2. Bentz, C.: Résolution exacte et approchée de problèmes de multiflot entier et de multicoupe: algorithmes et complexité. PhD Thesis, CNAM, Paris (2006) (in French)
3. Bentz, C.: On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Discrete Applied Mathematics 156, 1908–1917 (2008)
4. Bentz, C.: A simple algorithm for multicuts in planar graphs with outer terminals. Discrete Applied Mathematics 157, 1959–1964 (2009)
5. Bentz, C.: New results on planar and directed multicuts. In: EUROCOMB 2009 (2009)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献