A Min-Max Theorem on Feedback Vertex Sets
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Circuit Mengerian Directed Graphs
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improving disk reuse for reducing power consumption
ISLPED '07 Proceedings of the 2007 international symposium on Low power electronics and design
Improving I/O performance of applications through compiler-directed code restructuring
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Optimizing shared cache behavior of chip multiprocessors
Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture
An efficient algorithm for finding maximum cycle packings in reducible flow graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We obtain a necessary and sufficient condition for tournaments to possess a min-max relation on packing and covering directed cycles, together with strongly polynomial time algorithms for the feedback vertex set problem and the cycle packing problem in this class of tournaments; the condition and the algorithms are all based on a totally dual integral (TDI) system, a theoretical framework introduced by Edmonds and Giles for establishing min-max results. As a consequence, we find a $2.5$-approximation polynomial time algorithm for the feedback vertex set problem in any tournament.