Author:
Hassin Refael,Segev Danny
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Arora, S., Karakostas, G.: A 2+ ε approximation algorithm for the k-MST problem. In: Proc. SIAM Symp. on Discrete Algorithms (2000)
2. Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica 29, 410–421 (2001)
3. Frederickson, G.N., Johnson, D.B.: Generating and searching sets induced by network , LNCS, vol. 85, pp. 221–233 (1980)
4. Gale, D.: Optimal assignments in an ordered set: An application of matroid theory. J. of Combinatorial 4, 176–180 (1968)
5. Garg, N.: A 3-approximation for the minimum tree spanning k vertices. In: Proc. IEEE Symp. on Foundations of Computer Science (1996), pp. 302–309 (1996)