Primal-dual approximation algorithms for feedback problems in planar graphs

This publication has 16 references indexed in Scilit:

• An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
  Combinatorica, 1995
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
  SIAM Journal on Computing, 1995
• A General Approximation Technique for Constrained Forest Problems
  SIAM Journal on Computing, 1995
• Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
  Published by Springer Nature ,1995
• Approximation Algorithms for the Loop Cutset Problem
  Published by Elsevier ,1994
• Approximate max-flow min-(multi)cut theorems and their applications
  Published by Association for Computing Machinery (ACM) ,1993
• Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
  Lecture Notes in Computer Science, 1993
• An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Maximum induced forests of planar graphs
  Graphs and Combinatorics, 1987
• On acyclic colorings of planar graphs
  Discrete Mathematics, 1979