Applications of the linear matroid parity algorithm to approximating Steiner trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3967 LNCS, Issue , 2006, Pages 70-79

  Berman, Piotr ^a   Fürer, Martin ^a   Zelikovsky, Alexander ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Approximation ratio; Matroid; Parity matroid problem; Steiner trees

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

APPROXIMATION RATIO; MATROID; PARITY MATROID PROBLEM; STEINER TREES;

LINEAR SYSTEMS;

EID: 33745922384     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11753728_10     Document Type: Conference Paper

References (8)

1. M. Bern and P. Plassmann. The Steiner tree problem with edge lengths 1 and 2, Inform. Process. Lett. 32: 171-176, 1989.
2. G. Calinescu, C.G. Fernandas, U. Finkler and H. Karloff. A better approximation algorithm for finding planar subgraphs. Proc. 7th SODA: 16-25, 1996.
3. H.N. Gabow and M. Stallmann. Efficient algorithms for graphic matroid intersection and parity. Proc. ICALP'85. Lecture Notes in Computer Science, 194: 210-220, 1985.
4. C. Gröpl, S. Hougardy, T.Nierhoff and H.J.Prömel. Steiner trees in uniformly quasi-bipartite graphs. Information Processing Letters, 83:1915-200, 2002.
5. L. Lovász, The matroid matching problem. Algebraic Methods in Graph Theory, vol. 2, North Holland, 495-518, 1981.
6. L. Lovász and M.D. Plummer. Matching Theory. Elsevier Science, Amsterdam, 1986.
7. Orlin and Vande Vate, Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems. Mathematical Programming 47 (Series A), 81-106, 1990.
8. G. Robins and A. Zelikovsky. Tighter Bounds for Graph Steiner Tree Approximation. SIAM Journal on Discrete Mathematics, 19:122-134, 2005.