Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments

DOI10.1007/978-3-642-02017-9_39zbMath1241.68133MaRDI QIDQ3630222

Anke van Zuylen

Publication date: 3 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_39

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C05: Linear programming

90C59: Approximation methods and heuristics in mathematical programming

68W25: Approximation algorithms

05C20: Directed graphs (digraphs), tournaments

Related Items

On the complexity of compressing two dimensional routing tables with order, Fixed-parameter tractability results for feedback set problems in tournaments, Circular Convex Bipartite Graphs: Feedback Vertex Set, Two Hardness Results on Feedback Vertex Sets