Heuristics for the K-cardinality tree and subgraph problems

Asia-Pacific Journal of Operational Research

Volumn 14, Issue 1, 1997, Pages 87-114

  Ehrgott, Matthias ^a   Hamacher, Horst W ^a   Freitag, Jörg ^b,d   Maffioli, Francesco ^c  

^a University of Koblenz Landau   (Germany)

^b Colonia Insurance ^*  (Germany)

^c POLITECNICO DI MILANO   (Italy)

^d University of Kaiserslautern ^*  (Germany)

Author keywords

Dual greedy; Greedy; Heuristic; K cardinality subgraph; K cardinality tree; Numerical test

Indexed keywords

EID: 0043253486     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. Awerbuch, B., Y. Azar, A. Blum and S. Vempala (1995), Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 277-283.
2. Blum, A., P. Chalasani and A. Vempala (1995), A constant-factor approximation for the k-MST problem in the plane, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, 294-302.
3. Blum, A., R. Ravi and S. Vempala (1996), A constant-factor approximation algorithm for the k-MST problem, Technical Report, School of Computer Science, Carnegie Mellon University.
4. Dijkstra, E. (1959), A note on two problems in connexion with graphs, Numerische Mathematik 1, 269-271.
5. Ehrgott, M. (1992), Optimization problems in graphs under cardinality restrictions (in German), Master's Thesis, University of Kaiserslautern, Department of Mathematics.
6. Ehrgott, M. (1995), K-cardinality subgraphs, in OR Proceedings 94, Selected Papers of the International Conference on Operations Research, Berlin, 86-91 (Springer).
7. Ehrgott, M. and J. Freitag (1996), K-Tree/K-Subgraph : A program package for minimal weighted K-cardinality-trees and -subgraphs, European Journal of Operational Research 93 (1), 224-225.
8. Faigle, U. and W. Kern (1994), Computational complexity of some maximum average weight problems with precedence constraints, Operations Research 42 (4), 688-693.
9. Fischetti, M., H. Harnacher, K. Joernsten and F. Maffioli (1994), Weighted k-cardinality trees: Complexity and polyhedral structure, Networks 24, 11-12.
10. Foulds, L. and H. Harnacher (1992), A new integer programming approach to (restricted) facilities layout problems allowing flexible facility shapes, Technical Report 1992-3, University of Waikato, Department of Management Science.
11. Freitag, J. (1993), Minimal k-cardinality trees (in German), Master's thesis, University of Kaiserslautern, Department of Mathematics.
12. Garg, N. and D. Hochbaum (1994), An O (log k) approximation algorithm for the k minimum spanning tree problem in the plane, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 432-438.
13. Harnacher, H. and K. Joernsten (1993), Optimal relinquishment according to the Norwegian petrol law: A combinatorial optimization approach, Technical Report No. 7/93, Norwegian School of Economics and Business Administration, Bergen. (Submitted to Applied Mathematical Modelling)
14. Harnacher, H., K. Joernsten and F. Maffioli (1991), Weighted k-cardinality trees, Technical Report 91.023, Politecnico di Milano, Dipartimento di Elettronica.
15. Joernsten, K. and A. Lokketangen (1996), Tabu search for weighted k-cardinality trees, Asia Pacific Journal of Operational Research (to appear).
16. Kruskal, J. (1956), On the shortest spanning subtree of a graph and the travelling salesman problem, Proceedings of the American Mathematical Society 7, 48-50.
17. Maffioli, F. (1991), Finding a best subtree of a tree, Technical Report 91.041, Politecnico di Milano, Dipartimento di Elettronica.
18. Mehlhorn, K. (1984), Data Structures and Algorithms 1 : Sorting and Searching, Springer Verlag, Berlin.
19. Prim, J. (1957), Shortest connection networks and some generalizations, Bell System Technics Journal 36, 1389-1401.
20. Ravi, R., R. Sundaram, M. Marathe, D. Rosenkrantz and S. Ravi (1996), Spanning trees - short or small, SIAM Journal on Discrete Mathematics 9 (2), 178 - 200.
21. Woeginger, G. (1992), Computing maximum valued regions, Acta Cybernetica 10 (4), 3030-315.