A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

Operations Research Letters

Volumn 32, Issue 3, 2004, Pages 233-239

  Hong, Sung Pil ^a   Chung, Sung Jin ^b   Park, Bum Hwan ^b  

^a Chung Ang University   (South Korea)

^b Seoul National University   (South Korea)

Author keywords

Bicriteria approximation; Fully polynomial approximation scheme; Matrix tree theorem; Spanning tree

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; OPERATIONS RESEARCH; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

SEARCH ALGORITHMS; SPANNING TREES;

TREES (MATHEMATICS);

EID: 0346910310     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.06.003     Document Type: Article

References (19)

1. Aggarwal V., Aneja Y.P., Nair K.P. Minimal spanning tree subject to a side constraint. Comput. Oper. Res. 9(4):1982;287-296.
2. Aho A.V., Hopcroft J.E., Ullmann J.D. The Design and Analysis of Computer Algorithms. 1976;Addition-Wesley, Reading, MA.
3. Barahona F., Pulleyblank W.R. Exact arborescences, matchings and cycles. Discrete Appl. Math. 16:1987;91-99.
4. Basov I., Vainshtein A. Approximation algorithms for multi-parameter graph optimization problems. Discrete Appl. Math. 119:2002;129-138.
5. Blokh D., Gutin G. An approximate algorithm for combinatorial optimization problems with two parameters. Australa. J. Combin. 14(2):1996;157-164.
6. Broder A.Z., Mayr E.W. Counting minimum weight spanning trees. J. Algorithms. 24:1997;171-176.
7. Chaiken S. A combinatorial proof of the all minors matrix tree theorem. SIAM J. Algebraic Discrete Methods. 3:1982;319-329.
8. Chaiken S., Kleitman D.J. Matrix tree theorem. J. Combin. Theory A. 24:1978;377-381.
9. Hassin R. Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17(1):1992;36-42.
10. Horowitz E., Sahni S. Fundamentals of Computer Algorithms. 1989;Computer Science Press, Maryland.
11. Ibarra O., Kim C. Fast approximation algorithms for the knapsack and sum of subsets problems. J. Assoc. Comput. Mach. 22:1975;463-468.
12. Lorenz D.H., Raz D. A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5):2001;213-219.
13. Mahajan M., Vinay V. Determinant. old algorithms, new insights SIAM J. Discrete Math. 12(4):1999;474-490.
14. Marathe M.V., Ravi R., Sundaram R., Ravi S.S., Rosenkrantz D.J., Hunt III H.B. Bicriteria network design problems. J. Algorithms. 28:1998;142-171.
15. R. Ravi, M.X. Goemans, The constrained minimum spanning tree problem, In: Proceedings of the Scandinavian Workshop on Algorithmic Theory (SWAT), Springer, 1996, pp. 66-75.
16. Schrijver A. Combinatorial Optimization: Polyhedra and Efficiency. 2003;Springer, Berlin.
17. Sylvester J.J. On the change of systems of independent variables. Quart. J. Pure. Appl. Math. 1:1855;42-56.
18. Tutte W.T. The dissection of equilateral triangles into equilateral triangles. Proc. Cambridge Philos. Soc. 44:1948;463-482.
19. Warburton A. Approximation of pareto optima in multiple-objective, shortest-path problems. Oper. Res. 35(1):1987;70-79.