Author:
Althaus Ernst,Blumenstock Markus,Disterhoft Alexej,Hildebrandt Andreas,Krupp Markus
Publisher
Springer International Publishing
Reference31 articles.
1. Arora, S., Karakostas, G.: A 2 +
$$\epsilon $$
approximation algorithm for the k-MST problem. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’00, pp. 754–759. Society for Industrial and Applied Mathematics, Philadelphia (2000)
2. Álvarez Miranda, E., Ljubić, I., Mutzel, P.: The maximum weight connected subgraph problem. In: Jünger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 245–270. Springer, Heidelberg (2013)
3. Blum, C., Blesa, M.J.: New metaheuristic approaches for the edge-weighted K-cardinality tree problem. Comput. Oper. Res. 32(6), 1355–1377 (2005)
4. Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities - an
$${O}(n^{1/4})$$
approximation for densest
$$k$$
-subgraph. In: Proceedings of the Forty-second ACM Symposium on Theory of Computing, STOC ’10, pp. 201–210. ACM, New York (2010)
5. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献