Decomposition algorithms for the maximum-weight connected graph problem

Naval Research Logistics

Volumn 45, Issue 8, 1998, Pages 817-837

  Lee, Heungsoon Felix ^a   Dooly, Daniel R ^b  

^a SOUTHERN ILLINOIS UNIVERSITY EDWARDSVILLE   (United States)

^b WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

DECOMPOSITION ALGORITHMS; MAXIMUM-WEIGHT CONNECTED GRAPH PROBLEM (MCG);

GRAPH THEORY;

EID: 0032311637     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199812)45:8<817::AID-NAV4>3.0.CO;2-1     Document Type: Article

References (17)

1. Awerbuch, B., Azar, Y., Blum, A., and Vempala, S., "Improved Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesman," Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, 1995, pp. 277-283.
2. Blum, A., Ravi, R., and Vempala. S., "A Constant-Factor Approximation Algorithm for the k-MST Problem," Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1996, pp. 442-448.
3. Cormen. T.H., Leiserson, C.E., and Rivest, R.L., Introduction to Algorithms. The MIT Press, Cambridge, MA, 1991.
4. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
5. Garg, N., "A 3-Approximation for the Minimum Tree Spanning k Vertices," Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996. pp. 302-309.
6. Garg, N., and Hochbaum, D., "An O(log k) Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane," Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 432-438.
7. Goldschmidt, O., and Hochbaum, D., "k-Edge Subgraph Problems." Discrete Applied Mathematics, 74, 159-169 (1997).
8. Hochbaum, D., "Why Should Biconnected Components be Identified First." Discrete Applied Mathematics, 42, 203-210 (1993).
9. Knuth, D.E., The Stanford Graphbase: A Platform for Combinatorial Computing, Addison Wesley, New York, 1993.
10. Kortsarz, G., and Peleg, D., "On Choosing a Dense Subgraph." Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993, pp. 692-703.
11. Lee, H.F., and Dooly, D.R., "Algorithms for the Constrained Maximum-Weight Connected Graph Problem," Naval Research Logistics, 43, 985-1008 (1996).
12. Lee, H.F., and Dooly, D.R., "Heuristic Algorithms for the Fiber-Optic Network Expansion Problem," Telecommunication Systems, 7, 355-378 (1997).
13. Palmer, E.M., Graphical Evolution: An Introduction to the Theory of Random Graphs, Wiley, New York, 1985.
14. Ravi, R., Sundaram, R., Marathe, M.V., Rosenkrantz, D.J., and Ravi, S.S., "Spanning Trees Short and Small," Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 546-555.
15. Ross, S.M., Introduction to Probability Models (2nd ed.), Academic, New York, 1980.
16. Tarjan, R.E., "Efficiency of a Good But Not Linear Set Union Algorithm," Journal of the ACM, 22(2), 215-225 (1975).
17. Wormald, N.C., "Some Problems in the Enumeration of Labelled Graphs," Ph.D. Dissertation, University of Newcastle, N.S.W., Australia.