Obtaining optimal k-cardinality trees fast

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 27-36

  Chimani, Markus ^a   Kandyba, Maria ^a,b   Ljubić, Ivana ^c,d   Mutzel, Petra ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

^b Deutsche Forschungsgemeinschaft   (Germany)

^c UNIVERSITY OF VIENNA   (Austria)

^d Hertha Firnberg Fellowship Austrian Science Foundation   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORESTRY; HEURISTIC ALGORITHMS; OPTIMIZATION; TREES (MATHEMATICS);

CARDINALITIES; EDGE WEIGHTS; GRAPH G; HEURISTICS APPROACHES; ILP FORMULATION; INTEGER NUMBERS; META-HEURISTIC APPROACH; POSITIVE INTEGERS; SUB TREES; UNDIRECTED GRAPH;

UNDIRECTED GRAPHS;

EID: 78650420759     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972887.3     Document Type: Conference Paper

References (27)

1. S. Arora and G. Karakostas. A (2 + ε)-approximation algorithm for the k-MST problem. In Proc. of the eleventh annual ACM-SIAM symposium on Discrete algorithms (SODA'00), pages 754-759, 2000.
2. M. J. Blesa and F. Xhafa. A C++ Implementation of Tabu Search for k-Cardinality Tree Problem based on Generic Programming and Component Reuse. In c/o tranSIT GmbH, editor, Net.ObjectDsays 2000 Tagungsband, pages 648-652, Erfurt, Germany, 2000. Net. ObjectDays-Forum.
3. A. Blum, R. Ravi, and S. Vempala. A constant-factor approximation algorithm for the k-MST problem. In ACM Symposium on Theory of Computing, pages 442-448, 1996.
4. C. Blum. A new hybrid evolutionary algorithm for the huge k-cardinality tree problem. In Proc. of Genetic and Evolutionary Computation Conference (GECCO'06), pages 515-522, New York, NY, USA, 2006. ACM Press.
5. C. Blum. Revisiting dynamic programming for finding optimal subtrees in trees. European Journal of Operational Research, 177(1):102-115, 2007.
6. C. Blum and M. Blesa. KCTLIB - a library for the edge-weighted k-cardinality tree problem, http://iridia.ulb.ac.be/cblum/kctlib/.
7. C. Blum and M. Blesa. Combining ant colony optimization with dynamic programming for solving the k-cardinality tree problem. In Proc. of Computational Intelligence and Bioinspired Systems, 8th International Work-Conference on Artificial Neural Networks, (IWANN'05), volume 3512 of Lecture Notes in Computer Science, Barcelona, Spain, 2005. Springer.
8. C. Blum and M. J. Blesa. New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Computers & OR, 32:1355-1377, 2005.
9. C. Blum and M. Ehrgott. Local search algorithms for the k-cardinality tree problem. Discrete Applied Mathematics, 128(2-3):511-540, 2003.
10. J. Brimberg, D. Urošević, and N. Mladenović. Variable neighborhood search for the vertex weighted k-cardinality tree problem. European Journal of Operational Research, 171(l):74-84, 2006.
11. T. N. Bui and G. Sundarraj. Ant system for the k-cardinality tree problem. In Proc. of Genetic and Evolutionary Computation Conference (GECCO'04), volume 3102 of Lecture Notes in Computer Science, pages 36-47, Seattle, WA, USA, 2004. Springer.
12. M. Chimani, M. Kandyba, and P. Mutzel. A new ILP formulation for 2-root-connected prize-collecting Steiner networks. In Pruc. of 15th Annual European Symposium on Algorithms (ESA'07), volume 4698 of Lecture Notes in Computer Science, pages 681-692, Eilat, Israel, 2007. Springer.
13. M. Ehrgott and J. Freitag. K-TREE/K-SUBGRAPH: a program package for minimal weighted k-cardinality tree subgraph problem. European Journal of Operational Research, l(93):214-225, 1996.
14. M. Ehrgott, J. Freitag, H.W. Hamacher, and F. Maffi-oli. Heuristics for the k-cardinality tree and subgraph problem. Asia Pacific J. Oper. Res., 14(1):87-114, 1997.
15. M. Fischetti, W. Hamacher, K. Jornsten, and F. Maf-fioli. Weighted k-cardinality trees: Complexity and polyhedral structure. Networks, 24:11-21, 1994.
16. D. Gale. A theorem on flows in networks. Pacific J. Math, 7:1073-1082, 1957.
17. N. Garg. A 3-approximation for the minimum tree spanning k vertices. In Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS'96), pages 302-309, Washington, DC, USA, 1996. IEEE Computer Society.
18. N. Garg. Saving an epsilon: a 2-approximation for the k-MST problem in graphs. In Proc. of the thirty-seventh annual ACM symposium on Theory of computing (STOC'05), pages 396-402. ACM Press, 2005.
19. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, 1995.
20. M.X. Goemans and Y. Myung. A catalog of Steiner tree formulations. Networks, 23:19-28, 1993.
21. T. Koch and A. Martin. Solving Steiner tree problems in graphs to optimality. Networks, 32:207-232, 1998.
22. I. Ljubić. Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, Technische Universität Wien, 2004.
23. I. Ljubić, R. Weiskircher, U. Pferschy, G. Klau, P. Mutzel, and M. Fischetti. An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming, Series B, 105(2-3):427-449, 2006.
24. A. Segev. The node-weighted Steiner tree problem. Networks, 17(1):1 17, 1987.
25. D. Urošević, J. Brimberg, and N. Mladenović. Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Computers & OR, 31(8):1205-1213, 2004.
26. Standard performance evaluation corporation,http://www.spec.org/.
27. L. A. Wolsey. Integer Programming. Wiley-Interscience, 1998.