A Min-Max Theorem on Tournaments

DOI10.1137/060649987zbMath1191.90028OpenAlexW1964751355MaRDI QIDQ3507526

Xiao-Dong Hu, Wenan Zang, Xu-jin Chen

Publication date: 19 June 2008

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10722/75153

zbMATH Keywords

coveringpackingtournamentfeedback vertex setmin-max relation

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (7)

Finding good 2-partitions of digraphs. I. Hereditary properties ⋮ Are there any good digraph width measures? ⋮ Coloring digraphs with forbidden cycles ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ On ideal semicomplete digraphs ⋮ Coloring tournaments: from local to global ⋮ Tournaments and Semicomplete Digraphs

This page was built for publication: A Min-Max Theorem on Tournaments