Approximating Node-Deletion Problems for Matroidal Properties

This publication has 16 references indexed in Scilit:

• Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications
  SIAM Journal on Discrete Mathematics, 2000
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
  SIAM Journal on Computing, 1998
• A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
  Operations Research Letters, 1998
• Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
  Algorithmica, 1998
• Some optimal inapproximability results
  Published by Association for Computing Machinery (ACM) ,1997
• 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
• Multiway cuts in directed and node weighted graphs
  Lecture Notes in Computer Science, 1994
• Proof verification and hardness of approximation problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979