Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
From MaRDI portal
Publication:3630222
DOI10.1007/978-3-642-02017-9_39zbMath1241.68133OpenAlexW2175152198MaRDI QIDQ3630222
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
Programming involving graphs or networks (90C35) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
On the complexity of compressing two dimensional routing tables with order ⋮ Two Hardness Results on Feedback Vertex Sets ⋮ Fixed-parameter tractability results for feedback set problems in tournaments ⋮ Circular Convex Bipartite Graphs: Feedback Vertex Set
This page was built for publication: Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments