Author:
Drangmeister Kay U.,Krurnke Sven O.,Marathe Madhav V.,Noltemeier Hartmut,Ravi S.S.
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. When trees collide: an approximation algorithm for the generalized Steiner problem on networks;Agrawal,1991
2. Improving the location of minisum facilities through network modification;Berman;Ann. Oper. Res.,1992
3. Linear-time computation of optimal subgraphs of decomposable graphs;Bern;J. Algorithms,1987
4. A constant factor approximation for the k-mst problem;Blum,1996
5. Parallel merge sort;Cole;SIAM J. Comput.,1988
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献