Handbook of combinatorics (vol. 2)
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
On Feedback Problems in Diagraphs
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
A TDI System and Its Application to Approximation Algorithms
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Circuit Mengerian Directed Graphs
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
We establish a necessary and sufficient condition for the linear system {x : Hx ≥ e,x ≥ 0} associated with a bipartite tournament to be TDI, where H is the cycle-vertex incidence matrix and e is the all-one vector. The consequence is a min-max relation on packing and covering cycles, together with strongly polynomial time algorithms for the feedback vertex set problem and the cycle packing problem on the corresponding bipartite tournaments. In addition, we show that the feedback vertex set problem on general bipartite tournaments is NP-complete and approximable within 3.5 based on the max-min theorem.