An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection

SIAM Journal on Computing

Volumn 33, Issue 2, 2004, Pages 261-268

  Hassin, Refael ^a   Levin, Asaf ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithm; Bicriteria optimization; Matroid intersection; Spanning tree

Indexed keywords

ALGORITHMS; FUNCTIONS; INTEGER PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHM; BICRITERIA OPTIMIZATION; MATROID INTERSECTION; SPANNING TREE;

TREES (MATHEMATICS);

EID: 2342527182     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703426775     Document Type: Article

References (16)

1. V. AGGARWAL, Y. ANEJA, AND K. NAIR, Minimal spanning tree subject to a side constraint, Comput. Oper. Res., 9 (1982), pp. 287-296.
2. K. A. ANDERSEN, K. JORNSTEN, AND M. LIND, On bicriterion minimal spanning trees: An approximation, Comput. Oper. Res., 23 (1996), pp. 1171-1182.
3. C. BREZOVEC, G. CORNUEJOLS, AND F. GLOVER, Two algorithms for weighted matroid intersection, Math. Program., 36 (1986), pp. 39-53.
4. C. BREZOVEC, G. CORNUEJOLS, AND F. GLOVER, A matroid algorithm and its application to the efficient solution of two optimization problems on graphs, Math. Program., 42 (1988), pp. 471-487.
5. P. CHALASANI AND R. MOTWANI, Approximating capacitated routing and delivery problems, SIAM J. Comput., 28 (1999), pp. 2133-2149.
6. R. COLE, Slowing down sorting networks to obtain faster sorting algorithms, J. ACM, 34 (1987), pp. 200-208.
7. W. J. COOK, W. H. CUNNINGHAM, W. R. PULLEYBLANK, AND A. SCHRIJVER, Combinatorial Optimization, John Wiley and Sons, New York, 1998.
8. G. N. FREDERICKSON AND M. A. SRINIVAS, Algorithms and data structures for an expanded family of matroid intersection problems, SIAM J. Comput., 18 (1989), pp. 112-138.
9. M. X. GOEMANS AND R. RAVI, The constrained minimum spanning tree problem, in Proceedings of SWAT 96, Lecture Notes in Comput. Sci. 1097, Springer-Verlag, New York, 1996, pp. 66-75.
10. D. GUSFIELD, Parametric combinatorial computing and a problem of program module distribution, J. ACM, 30 (1983), pp. 551-563.
11. R. HASSIN, Approximation schemes for the restricted shortest path problem, Math. Oper. Res., 17 (1992), pp. 36-42.
12. S.-P. HONG, S.-J. CHUNG, AND B. H. PARK, A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem, Oper. Res. Lett., to appear.
13. K. JORNSTEN AND S. MIGDALAS, Designing a minimal spanning tree network subject to a budget constraint, Optimization, 19 (1988), pp. 475-484.
14. E. LAWLER, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
15. D. H. LORENZ AND D. RAZ, A simple efficient approximation scheme for the restricted shortest path problem, Oper. Res. Lett., 28 (2001), pp. 213-219.
16. N. MEGIDDO, Applying parallel computation algorithms in the design of serial algorithms, J. ACM, 30 (1983), pp. 852-865.