We obtain a necessary and sufficient condition in terms of forbidden structures for tournaments to possess the 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. Applying the local ratio technique of Bar-Yehuda and Even to the forbidden structures, we find a 2.5-approximation polynomial time algorithm for the feedback vertex set problem in any tournament.
Let A be a 0 − 1 matrix with precisely two 1's in each column and let 1 be the all-one vector. We show that the problems of deciding whether the linear system Ax ≥ 1, x ≥ 0 (1) defines an integral polyhedron, (2) is totally dual integral (TDI), and (3) is box-totally dual integral (box-TDI) are all co-NP-complete, thereby confirming the conjecture on NP-hardness of recognizing TDI systems made by Edmonds and Giles in 1984.
A graph G is called cycle Mengerian (CM) if for all nonnegative integral function w defined on V ðGÞ; the maximum number of cycles (repetition is allowed) in G such that each vertex v is used at most wðvÞ times is equal to the minimum of P fwðxÞ : x 2 X g; where the minimum is taken over all X V ðGÞ such that deleting X from G results in a forest. The purpose of this paper is to characterize all CM graphs in terms of forbidden structures. As a corollary, we prove that if the fractional version of the above minimization problem always have an integral optimal solution, then the fractional version of the maximization problem will always have an integral optimal solution as well. # 2002 Elsevier Science (USA)
Let k and r be two integers with k ≥ 2 and k ≥ r ≥ 1. In this paper we show that (1) if a strongly connected digraph D contains no directed cycle of length 1 modulo k, then D is k-colorable; and (2) if a digraph D contains no directed cycle of length r modulo k, then D can be vertex-colored with k colors so that each color class induces an acyclic subdigraph in D. The first result gives an affirmative answer to a question posed by Tuza in 1992, and the second implies the following strong form of a conjecture of Diwan, Kenkre and Vishwanathan: If an undirected graph G contains no cycle of length r modulo k, then G is k-colorable if r = 2 and (k + 1)-colorable otherwise. Our results also strengthen several classical theorems on graph coloring proved
We establish a necessary and sufficient condition for the linear system {x : Hx ≥ e, x ≥ 0} associated with a bipartite tournament to be totally dual integral, 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 min-max theorem.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.