Ranking tournaments with no errors. II: Minimax relation
type: Item
instance of: scholarly article
title: Ranking tournaments with no errors. II: Minimax relation
zbMATH Open document ID: 1437.05085
author: Guoli Ding
author: Wenan Zang
author: Xujin Chen
author: Qiu-Lan Zhao
published in: Journal of Combinatorial Theory. Series B
publication date: 2020-04-07T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 7187470
zbMATH Keywords: tournament
zbMATH Keywords: feedback arc set
zbMATH Keywords: integrality
zbMATH Keywords: duality
zbMATH Keywords: algorithm
MaRDI profile type: Publication
full work available at URL: j.jctb.2019.10.004
OpenAlex ID: W2981646601
cites work: Integral infeasibility and testing total dual integrality
cites work: Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
cites work: An approximation algorithm for feedback vertex sets in tournaments
cites work: Ranking tournaments with no errors. I: Structural description
cites work: Packing cycles in graphs. II
cites work: Packing cycles in graphs
cites work: Q4149476
cites work: Packing odd circuits in Eulerian graphs
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Q4537698
cites work: A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
cites work: Packing directed circuits exactly
cites work: A Minimax Theorem for Directed Graphs
cites work: Q3818127
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: The matroids with the max-flow min-cut property
cites work: Packing circuits in eulerian digraphs
cites work: Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
DOI: 10.1016/J.JCTB.2019.10.004
Recommended article: Ranking tournaments with no errors. I: Structural description
Recommended article: Some Impossibilities of Ranking in Generalized Tournaments
Recommended article: On the Minimum Violations Ranking of a Tournament
Recommended article: A Min-Max Theorem on Tournaments
Recommended article: A note on min-max pair in tournaments
Recommended article: The first-order approach in rank-order tournaments
Recommended article: Tournament Ranking with Expected Profit in Polynomial Time
Recommended article: Q3139850
Recommended article: An alternative interpretation of random noise in rank-order tournaments
Recommended article: On negative dependence inequalities and maximal scores in round-robin tournaments
description: scientific article; zbMATH DE number 7187470