File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.jctb.2019.10.004
- Scopus: eid_2-s2.0-85074456334
- WOS: WOS:000525384800009
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Ranking Tournaments with No Errors II: Minimax Relation
| Title | Ranking Tournaments with No Errors II: Minimax Relation |
|---|---|
| Authors | |
| Keywords | Algorithm Duality Feedback arc set Integrality Tournament |
| Issue Date | 2020 |
| Publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctb |
| Citation | Journal of Combinatorial Theory, Series B, 2020, v. 142, p. 244-275 How to Cite? |
| Abstract | A tournament T=(V,A) is called cycle Mengerian (CM) if it satisfies the minimax relation on packing and covering cycles, for every nonnegative integral weight function defined on A. The purpose of this series of two papers is to show that a tournament is CM iff it contains none of four Möbius ladders as a subgraph; such a tournament is referred to as Möbius-free. In the first paper we have given a structural description of all Möbius-free tournaments, and have proved that every CM tournament is Möbius-free. In this second paper we establish the converse by using our structural theorems and linear programming approach. © 2020 Elsevier Inc. |
| Description | Bronze open access |
| Persistent Identifier | http://hdl.handle.net/10722/289729 |
| ISSN | 2021 Impact Factor: 1.491 2020 SCImago Journal Rankings: 1.686 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chen, X | - |
| dc.contributor.author | Ding, G | - |
| dc.contributor.author | Zang, W | - |
| dc.contributor.author | Zhao, Q | - |
| dc.date.accessioned | 2020-10-22T08:16:38Z | - |
| dc.date.available | 2020-10-22T08:16:38Z | - |
| dc.date.issued | 2020 | - |
| dc.identifier.citation | Journal of Combinatorial Theory, Series B, 2020, v. 142, p. 244-275 | - |
| dc.identifier.issn | 0095-8956 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/289729 | - |
| dc.description | Bronze open access | - |
| dc.description.abstract | A tournament T=(V,A) is called cycle Mengerian (CM) if it satisfies the minimax relation on packing and covering cycles, for every nonnegative integral weight function defined on A. The purpose of this series of two papers is to show that a tournament is CM iff it contains none of four Möbius ladders as a subgraph; such a tournament is referred to as Möbius-free. In the first paper we have given a structural description of all Möbius-free tournaments, and have proved that every CM tournament is Möbius-free. In this second paper we establish the converse by using our structural theorems and linear programming approach. © 2020 Elsevier Inc. | - |
| dc.language | eng | - |
| dc.publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctb | - |
| dc.relation.ispartof | Journal of Combinatorial Theory, Series B | - |
| dc.subject | Algorithm | - |
| dc.subject | Duality | - |
| dc.subject | Feedback arc set | - |
| dc.subject | Integrality | - |
| dc.subject | Tournament | - |
| dc.title | Ranking Tournaments with No Errors II: Minimax Relation | - |
| dc.type | Article | - |
| dc.identifier.email | Zang, W: wzang@maths.hku.hk | - |
| dc.identifier.authority | Zang, W=rp00839 | - |
| dc.description.nature | link_to_OA_fulltext | - |
| dc.identifier.doi | 10.1016/j.jctb.2019.10.004 | - |
| dc.identifier.scopus | eid_2-s2.0-85074456334 | - |
| dc.identifier.hkuros | 317358 | - |
| dc.identifier.volume | 142 | - |
| dc.identifier.spage | 244 | - |
| dc.identifier.epage | 275 | - |
| dc.identifier.isi | WOS:000525384800009 | - |
| dc.publisher.place | United States | - |
| dc.identifier.issnl | 0095-8956 | - |