$T$-连接的并进分数填充

SIAM J. Discret. Math. Pub Date : 2022-09-01 DOI:10.1137/21m1445260

Ahmad Abdi, G. Cornuéjols, Zuzanna Palion

{"title":"$T$-连接的并进分数填充","authors":"Ahmad Abdi, G. Cornuéjols, Zuzanna Palion","doi":"10.1137/21m1445260","DOIUrl":null,"url":null,"abstract":"Let G = (V,E) be a graph, and T ⊆ V a nonempty subset of even cardinality. The famous theorem of Edmonds and Johnson on the T -join polyhedron implies that the minimum cardinality of a T -cut is equal to the maximum value of a fractional packing of T -joins. In this paper, we prove that the fractions assigned may be picked as dyadic rationals, i.e. of the form a 2k for some integers a, k ≥ 0.","PeriodicalId":21749,"journal":{"name":"SIAM J. Discret. Math.","volume":"20 1","pages":"2445-2451"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On Dyadic Fractional Packings of $T$-Joins\",\"authors\":\"Ahmad Abdi, G. Cornuéjols, Zuzanna Palion\",\"doi\":\"10.1137/21m1445260\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G = (V,E) be a graph, and T ⊆ V a nonempty subset of even cardinality. The famous theorem of Edmonds and Johnson on the T -join polyhedron implies that the minimum cardinality of a T -cut is equal to the maximum value of a fractional packing of T -joins. In this paper, we prove that the fractions assigned may be picked as dyadic rationals, i.e. of the form a 2k for some integers a, k ≥ 0.\",\"PeriodicalId\":21749,\"journal\":{\"name\":\"SIAM J. Discret. Math.\",\"volume\":\"20 1\",\"pages\":\"2445-2451\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM J. Discret. Math.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/21m1445260\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM J. Discret. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/21m1445260","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

设G = (V,E)为一个图，T≤V为偶基数的非空子集。Edmonds和Johnson关于T连接多面体的著名定理表明，T切割的最小基数等于T连接的分数填充的最大值。本文证明了对于某些整数a, k≥0，所分配的分数可以取为并矢有理，即取为a 2k的形式。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On Dyadic Fractional Packings of $T$-Joins

Let G = (V,E) be a graph, and T ⊆ V a nonempty subset of even cardinality. The famous theorem of Edmonds and Johnson on the T -join polyhedron implies that the minimum cardinality of a T -cut is equal to the maximum value of a fractional packing of T -joins. In this paper, we prove that the fractions assigned may be picked as dyadic rationals, i.e. of the form a 2k for some integers a, k ≥ 0.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SIAM J. Discret. Math.

自引率

0.00%

发文量