Author:
Cheriyan Joseph,Vempala Santosh
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. A. Frank and T. Jordan, “Minimal edge-coverings of pairs of sets,” J. Combinatorial Theory, Series B, 65:73–110, 1995.
2. K. Jain, “A factor 2 approximation algorithm for the generalized Steiner network problem,” Proc. IEEE Foundations of Computer Science, 1998.
3. M. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos and D. Williamson, “Improved approximation algorithms for network design problems,” in Proc. ACM SIAM Symposium on Discrete Algorithms, 1994, 223–232.
4. M. Goemans and D. Williamson, “A general approximation technique for constrained forest problems,” SIAM Journal on Computing, 24:296–317, 1995.
5. V. Melkonian and E. Tardos, “Approximation algorithms for a directed network design problem,” In the Proceedings of the 7th International Integer Programming and Combinatorial Optimization Conference (IPCO’99), Graz, Austria, 1999.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献